NetworkX

Previous topic

networkx.algorithms.components.weakly_connected.weakly_connected_component_subgraphs

Next topic

networkx.algorithms.components.attracting.number_attracting_components

networkx.algorithms.components.attracting.is_attracting_component

is_attracting_component(G)

Returns True if G consists of a single attracting component.

Parameters:

G : DiGraph, MultiDiGraph

The graph to be analyzed.

Returns:

attracting : bool

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