Question & Answer: Write out a topological sorted order for the following graph:…..

Step 1: Identify vertices that have no incoming edges.

Step 2 : Delete this vertex of in-degree 0 and all its outgoing edges from the graph. Place it in the output.

Step 3: Repeat Steps 1 and Step 2 until graph is empty

Topological sorting : 4 9 3 1 7 2