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.
See also
attracting_components, number_attracting_components, attracting_component_subgraphs