3.4. Run the strongly connected components algorithm on the following directed graphs G. When doing DFS on G: whenever there is a choice of vertices to explore, always pick the one that is alphabetically first Show transcribed image text 3.4. Run the strongly connected components algorithm on the following directed graphs G. When doing DFS on G: whenever there is a choice of vertices to explore, always pick the one that is alphabetically first
Answer
Strongly Connected
OR
OR