Note

This documents the development version of NetworkX. Documentation for the current release can be found here.

networkx.algorithms.components.is_attracting_component

is_attracting_component(G)[source]

Returns True if G consists of a single attracting component.

Parameters
GDiGraph, MultiDiGraph

The graph to be analyzed.

Returns
attractingbool

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

Raises
NetworkXNotImplemented

If the input graph is undirected.