Expand description
Separate nodes of a directed graph into strongly connected components.
A path-based strong component algorithm is used.
Functions
Compute the strongly connected component containing a given node.
Partition all strongly connected components in a graph.
Partition nodes reachable from a starting point into strongly connected components.