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 Floyd Warshall Algorithm Transitive Closure Algorithm