networkx.algorithms.components.attracting.attracting_components

networkx.algorithms.components.attracting.attracting_components(G)

Returns a list of attracting components in .

An attracting component in a directed graph is a strongly connected component with the property that a random walker on the graph will never leave the component, once it enters the component.

The nodes in attracting components can also be thought of as recurrent nodes. If a random walker enters the attractor containing the node, then the node will be visited infinitely often.

Parameters :

G : DiGraph, MultiDiGraph

The graph to be analyzed.

Returns :

attractors : list

The list of attracting components, sorted from largest attracting component to smallest attracting component.

See also

number_attracting_components, is_attracting_component, attracting_component_subgraphs