Floyd-Warshall: All Pairs Shortest Paths

Given a directed weighted graph and several queries (a, b), print the shortest distance from a to b, or -1 if b cannot be reached.

1 <= n <= 400 0 <= m <= 10^4 1 <= w <= 10^6