all_pairs_shortest_path_length(G, cutoff=None)

Notes

The iterator returned only has reachable node pairs.

Parameters

G : NetworkX graph

cutoff : integer, optional

Depth at which to stop the search. Only paths of length at most :None:None:`cutoff` are returned.

Returns

lengths : iterator

(source, dictionary) iterator with dictionary keyed by target and shortest path length as the key value.

Computes the shortest path lengths between all nodes in G.

Examples

>>> G = nx.path_graph(5)
... length = dict(nx.all_pairs_shortest_path_length(G))
... for node in [0, 1, 2, 3, 4]:
...     print(f"1 - {node}: {length[1][node]}")
1 - 0: 1
1 - 1: 0
1 - 2: 1
1 - 3: 2
1 - 4: 3

>>> length[3][2]
1

>>> length[2][2]
0

See :

Back References

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

networkx.algorithms.shortest_paths.dense.floyd_warshall networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length networkx.algorithms.shortest_paths.weighted.johnson networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance networkx.algorithms.shortest_paths.generic.shortest_path_length

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/shortest_paths/unweighted.py#143
type: <class 'function'>
Commit: