networkx.algorithms.components.attracting.is_attracting_component

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

Returns True if consists of a single attracting component.

Parameters :

G : DiGraph, MultiDiGraph

The graph to be analyzed.

Returns :

attracting : bool

True if has a single attracting component. Otherwise, False.

See also

attracting_components, number_attracting_components, attracting_component_subgraphs