all_pairs_shortest_path_length¶

all_pairs_shortest_path_length(G, cutoff=None)[source]¶

Compute the shortest path lengths between all nodes in G.

Parameters:

G : NetworkX graph

cutoff : integer, optional

depth to stop the search. Only paths of length <= cutoff are returned.

Returns:

lengths : dictionary

Dictionary of shortest path lengths keyed by source and target.

Notes

The dictionary returned only has keys for reachable node pairs.

Examples

>>> G=nx.path_graph(5)
>>> length=nx.all_pairs_shortest_path_length(G)
>>> print(length[1][4])
3
>>> length[1]
{0: 1, 1: 0, 2: 1, 3: 2, 4: 3}