Returns the number of attracting components in G.
G
G (DiGraph, MultiDiGraph) – The graph to be analyzed.
n – The number of attracting components in G.
int
NetworkXNotImplemented : – If the input graph is undirected.
See also
attracting_components, is_attracting_component
attracting_components
is_attracting_component