Topological sorting is graph sorting in which the parent edges come before the children's edges. USING C++ PROGRAMMING LANGUAGE.

In Topological Sorting of a directed acyclic graph sorting of children's edges is done before the parent edges. In this, an indegree for every vertex of the graph is defined. In degree is the number of the incoming edges to the vertex of the graph. In this algorithm, we first give all vertex of the graph an in-degree of 0. Then we update indegree by traversing edges. Then start removing elements from the queue until empty. Then iterate over the neighbours of that node and reduce their indegree by 1.

Submitted by Madhavendra Krishana Gupta (Madhavendra)

Download packets of source code on Coders Packet