number_attracting_components(G)

Parameters

G : DiGraph, MultiDiGraph

The graph to be analyzed.

Raises

NetworkXNotImplemented

If the input graph is undirected.

Returns

n : int

The number of attracting components in G.

Returns the number of attracting components in G.

See Also

attracting_components

is_attracting_component

Examples

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.algorithms.components.attracting.attracting_components networkx.algorithms.components.attracting.is_attracting_component

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /networkx/algorithms/components/attracting.py#55
type: <class 'function'>
Commit: