networkx.all_pairs_dijkstra_path

all_pairs_dijkstra_path(G)

Compute shortest paths between all nodes in a weighted graph.

Parameters:

G : NetworkX graph

cutoff : integer, optional

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

Returns:

distance : dictionary

Dictionary, keyed by source and target, of shortest paths.

See also

floyd_warshall

Examples

>>> G=nx.path_graph(5)
>>> path=nx.all_pairs_dijkstra_path(G)
>>> print path[0][4]
[0, 1, 2, 3, 4]