7.12.4.1. networkx.algorithms.components.is_attracting_component¶

networkx.algorithms.components.is_attracting_component(G)[source]¶

Returns True if G consists of a single attracting component.

Parameters:	G : DiGraph, MultiDiGraph The graph to be analyzed.
Returns:	attracting : bool True if G has a single attracting component. Otherwise, False.
Raises:	NetworkXNotImplemented : If the input graph is undirected.

See also

attracting_components, number_attracting_components, attracting_component_subgraphs