is_attracting_component¶
-
networkx.algorithms.components.attracting.
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