Explain All-pair shortest-paths problem
Given a weighted linked graph (undirected or directed), the all pairs shortest paths problem asks to find the distances (the lengths of the shortest path) from every vertex to all other vertices.