all_pairs_shortest_path_length¶
-
all_pairs_shortest_path_length
(G, cutoff=None)[source]¶ Computes the shortest path lengths between all nodes in
G
.Parameters: - G (NetworkX graph)
- cutoff (integer, optional) – Depth at which to stop the search. Only paths of length at most
cutoff
are returned.
Returns: lengths – (source, dictionary) iterator with dictionary keyed by target and shortest path length as the key value.
Return type: iterator
Notes
The iterator returned only has reachable node pairs.
Examples
>>> G = nx.path_graph(5) >>> length = nx.all_pairs_shortest_path_length(G) >>> dict(length)[1] {0: 1, 1: 0, 2: 1, 3: 2, 4: 3}