NetworkX

Previous topic

weakly_connected_component_subgraphs

Next topic

number_attracting_components

is_attracting_component

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 : bool

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