A shortest path between two graph vertices (u, v) of a graph. There may be more than one different shortest paths, all of the same length. Graph geodesics may be found using a breadth-first traversal or using Dijkstra's algorithm. One (of possibly several) graph geodesics of a graph g from vertex u to vertex v can be found in the Wolfram Language using FindShortestPath[g, u, v]. The length of the graph geodesic between these points d(u, v) is called the graph distance between u and v. The length of the maximum geodesic in a given graph is called the graph diameter, and the length of the minimum geodesic is called the graph radius.

all-pairs shortest path | Bellman-Ford algorithm | Dijkstra's algorithm | Floyd-Warshall algorithm | geodetic graph | graph diameter | graph distance | graph distance matrix | shortest path problem

FindShortestPath