Question: 5. Consider the graph below. (a) from the smallest ID to the largest ID. Compute the discover time and the finishing time of each

5. Consider the graph below. (a) from the smallest ID to the largest ID. Compute the discover time and the finishing time of each vertex. Note that there will be ONLY one possible answer, because the way we scan the vertices is fixed. Suppose that we do a DFS starting at vertex 1. At each vertex, we scan its neighbors (b) Write down a topological ordering of the graph.
Step by Step Solution
3.40 Rating (150 Votes )
There are 3 Steps involved in it
a discover timenumber tells the time at which the node gets into the recursion stackencounterd ... View full answer
Get step-by-step solutions from verified subject matter experts
