Question: 5. (20 Points) Run the DFS algorithm on the digraph pictured below. Process vertices in the main loop of DFSO by increasing vertex label. Process
5. (20 Points) Run the DFS algorithm on the digraph pictured below. Process vertices in the main loop of DFSO by increasing vertex label. Process vertices in the for loop of Visit0 by increasing vertex labela As vertices finish, puch them onto a stack. Fill in the table below giving the adjacency list representation, diseover times, finish times and parents in the DFS forest. Draw the resulting DFS forest, and show the state of the stack when DFS is complete. Classify all edyes as of type tree, back forward or cross. List all directed cycles that this digraph contains. DFS Forest: Stacke
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
