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