Question: (20 pts.) Strongly Connected Components (SCC). Run the strongly connected components algorithm on the following directed graphs. When doing DFS on the reverse graph
(20 pts.) Strongly Connected Components (SCC). Run the strongly connected components algorithm on the following directed graphs. When doing DFS on the reverse graph GR: whenever there is a choice of vertices to explore, always pick the one that is alphabetically first. (i) (ii) B G I A E H C J F D A D G B E H C F I In each case answer the following questions. (a) In what order are the strongly connected components (SCCs) found? (b) Which are source SCCs and which are sink SCCs? (c) Draw the "metagraph" (each "meta-node" is an SCC of G). (d) What is the minimum number of edges you must add to this graph to make it strongly connected?
Step by Step Solution
3.44 Rating (157 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
