A shortest path between two vertices of a graph is a graph path of shortest possible length between them. Such paths are also known as graph geodesics, and the matrix giving the lengths of shortest paths between all pairs of vertices in a graph is known as a graph distance matrix. The problem of finding a shortest path in a graph is known as the shortest path problem.

all-pairs shortest path | antipodal graph | graph distance matrix | graph geodesic | shortest path problem | visibility polynomial