shortest-path spanning tree

The shortest path problem seeks to find the shortest path (a.k.a. graph geodesic) connecting two specific vertices (u, v) of a directed or undirected graph. The length of the graph geodesic between these points d(u, v) is called the graph distance between u and v. Common algorithms for solving the shortest path problem include the Bellman-Ford algorithm and Dijkstra's algorithm. The Wolfram Language function FindShortestPath[g, u, v] can be used to find one (of possibly mutiple) shortest path between vertices u and v in a graph g.

all-pairs shortest path | Bellman-Ford algorithm | Dijkstra's algorithm | Floyd-Warshall algorithm | graph distance | graph geodesic | longest path | reaching algorithm