Components in Graphs
- Let
be a directed graph. A strongly connected component(SCCs) of is a maximal set of vertices of each of which is reachable from any other. - NOTE: Strongly connected components partition the graph
- Algorithms
- Tarjan's Algorithm
- Kosaraju's Algorithm