Warning
This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
kosaraju_strongly_connected_components¶
- kosaraju_strongly_connected_components(G, source=None)[source]¶
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 component of G. The list is ordered from largest connected component to smallest.
Raises : NetworkXNotImplemented: If G is undirected
See also
connected_components
Notes
Uses Kosaraju’s algorithm.