#

Note

This documents the development version of NetworkX. Documentation for the current release can be found here.

#

networkx.algorithms.components.number_attracting_components¶

number_attracting_components(G)[source]¶

Returns the number of attracting components in G.

Parameters: G (DiGraph, MultiDiGraph) – The graph to be analyzed.
Returns: n – The number of attracting components in G.
Return type: int
Raises: NetworkXNotImplemented – If the input graph is undirected.

See also

attracting_components(), is_attracting_component()

#