reconstruct_path(source, target, predecessors)
This function is meant to give more applicability to the floyd_warshall_predecessor_and_distance function
Starting node for path
Ending node for path
Dictionary, keyed by source and target, of predecessors in the shortest path, as returned by floyd_warshall_predecessor_and_distance
A list of nodes containing the shortest path from source to target
If source and target are the same, an empty list is returned
Reconstruct a path from source to target using the predecessors dict as returned by floyd_warshall_predecessor_and_distance
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance
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