Returns the number of attracting components in \(G\).
G : DiGraph, MultiDiGraph
The graph to be analyzed.
n : int
The number of attracting components in G.
See also
attracting_components, is_attracting_component, attracting_component_subgraphs