Find all the shortest paths between every pair of vertices in a graph.

Can be used to find the diameter of a graph.

Related to Single Source Shortest Path

Approaches/Algorithms

Implementations	Running Time
Dijkstra’s on every pair of vertices
Floyd-Warshall