This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
Returns True if \(G\) consists of a single attracting component.
G : DiGraph, MultiDiGraph
The graph to be analyzed.
attracting : bool
True if \(G\) has a single attracting component. Otherwise, False.