weakly_connected_component_subgraphs
number_attracting_components
Enter search terms or a module, class or function name.
Returns True if consists of a single attracting component.
G : DiGraph, MultiDiGraph
The graph to be analyzed.
attracting : bool
True if has a single attracting component. Otherwise, False.
See also
attracting_components, number_attracting_components, attracting_component_subgraphs
consists of a single attracting component.