Add Floyd-Warshall algorithm

[Floyd-Warshall algorithm](https://en.wikipedia.org/wiki/Floyd_Warshall) computes shortest paths between all pairs of vertices at once in O(|V|^3).