number_attracting_components

number_attracting_components(G)

Returns the number of attracting components in G.

Parameters:

GDiGraph, MultiDiGraph

The graph to be analyzed.

Returns:

nint

The number of attracting components in G.

Raises:

NetworkXNotImplemented

If the input graph is undirected.

See also

attracting_components

is_attracting_component

---

Additional backends implement this function

parallelA networkx backend that uses joblib to run graph algorithms in parallel. Find the nx-parallel’s configuration guide here

The parallel computation is implemented by dividing the list of attracting components into chunks and then finding the length of each chunk in parallel and then adding all the lengths at the end.

Additional parameters:

get_chunksstr, function (default = “chunks”)

A function that takes in a list of attracting components as input and returns an iterable component_chunks. The default chunking is done by slicing the list of attracting components into n_jobs number of chunks.

[Source]