Warning

This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.

networkx.algorithms.components.is_attracting_component

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 – True if G has a single attracting component. Otherwise, False.
Return type:bool
Raises:NetworkXNotImplemented : – If the input graph is undirected.

See also

attracting_components(), number_attracting_components()