Finding strongly connected component of a graph
Strongly connected components are Set of vertices that are reachable from each other.
Strongly connected components of a graph can be found using DFS Algorithm • Depth First search (DFS)
Strongly connected components are Set of vertices that are reachable from each other.
Strongly connected components of a graph can be found using DFS Algorithm • Depth First search (DFS)