All-Pairs Shortest Paths Problem

• is a type of shortest-path problem where we need to find the shortest path between all possible pairs of vertices

Algorithms

• Transitive Closure Algorithm
• Floyd Warshall Algorithm