all-pairs shortest-path problem (n.) given a weighted graph, find the shortest path between every pair of vertices.
