Graph Theorymedium
0:00.0
In a directed graph, a strongly connected component is a maximal subset of vertices such that there is a directed path from any vertex to any other. How many strongly connected components are in the directed graph with edges {(1→2), (2→3), (3→1), (3→4), (4→5)}?
In a directed graph, a strongly connected component is a maximal subset of vertices such that there is a directed path from any vertex to any other. How many strongly connected components are in the directed graph with edges {(1→2), (2→3), (3→1), (3→4), (4→5)}?