This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
Generate nodes in strongly connected components of graph.
G : NetworkX Graph
An directed graph.
comp : generator of lists
A list of nodes for each component of G.
NetworkXNotImplemented: If G is undirected.
Uses Kosaraju’s algorithm.