This documents the development version of NetworkX. Documentation for the current release can be found here.
Find all-pairs shortest path lengths using Floyd’s algorithm.
- GNetworkX graph
- weight: string, optional (default= ‘weight’)
Edge data key corresponding to the edge weight.
A dictionary, keyed by source and target, of shortest paths distances between nodes.
Floyd’s algorithm is appropriate for finding shortest paths in dense graphs or graphs with negative weights when Dijkstra’s algorithm fails. This algorithm can still fail if there are negative cycles. It has running time \(O(n^3)\) with running space of \(O(n^2)\).