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.

Parameters :

G : NetworkX Graph

An directed graph.

Returns :

comp : generator of lists

A list of nodes for each strongly connected component of G.

Raises :

NetworkXNotImplemented: If G is undirected.

See also

connected_components, weakly_connected_components


Uses Tarjan’s algorithm with Nuutila’s modifications. Nonrecursive version of algorithm.


[R208]Depth-first search and linear graph algorithms, R. Tarjan SIAM Journal of Computing 1(2):146-160, (1972).
[R209]On finding the strongly connected components in a directed graph. E. Nuutila and E. Soisalon-Soinen Information Processing Letters 49(1): 9-14, (1994)..