Quiz: Floyd-Warshall Path Reconstruction

To reconstruct the shortest path from $i$ to $j$ in Floyd-Warshall, you store a next[i][j] matrix. If the shortest path from $i$ to $j$ goes through $k$, what should next[i][j] store?

1. A.The first vertex after $i$ on the shortest path to $j$
2. B.The vertex $k$ that minimized the path
3. C.The last vertex before $j$ on the shortest path
4. D.The total number of vertices on the path