Suppose that G is a directed graph with no circuits.
Chapter , Problem 40E(choose chapter or problem)
Problem 40E
Suppose that G is a directed graph with no circuits. Describe how depth-first search can be used to carry out a topological sort of the vertices of G.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer