Unformatted text preview: a, f, b, c, h, g, e, i, d Second step: Perform DFS on G T , the graph with all edges reversed, considering the vertices in the order listed above. a b g f c i e d h Since the resulting forest contains only 1 tree, the graph contains only 1 strongly connected component; therefore, we can say that the graph is strongly connected. 1...
View Full Document
- Spring '03
- Graph Theory, edges, Directed acyclic graph, 3 g, Strongly connected component