Find the weight (or length) of the shortest paths between all pairs of vertices in a weighted, directed graph.