Compute the shortest path lengths between all nodes in G.
Parameters : | G : NetworkX graph cutoff : integer, optional
|
---|---|
Returns : | lengths : dictionary
|
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}