Concepts2
βοΈAlgorithmIntermediate
Strongly Connected Components
Strongly Connected Components (SCCs) partition a directed graph into maximal groups where every vertex can reach every other vertex in the group.
#strongly connected components#tarjan#kosaraju+12
βοΈAlgorithmIntermediate
Tarjan's SCC Algorithm
Tarjanβs algorithm finds all Strongly Connected Components (SCCs) of a directed graph in a single depth-first search using a stack.
#tarjan scc#strongly connected components#low link+12