all_pairs_shortest_path(G, cutoff=None)

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 : dictionary

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

Compute shortest paths between all nodes.

See Also

floyd_warshall

Examples

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

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.generic.all_shortest_paths networkx.algorithms.shortest_paths.weighted.johnson networkx.algorithms.shortest_paths.generic.shortest_path networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance networkx.algorithms.shortest_paths.generic._build_paths_from_predecessors

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#429
type: <class 'function'>
Commit: