Floyd-Warshall (vectorized)

[fixed version] Vectorized Floyd-Warshall algorithm to find shortest paths and distances between every node pair.

Provides both shortest paths' distances and a function to get the path itself. If you only need the distances use FloydWarshall(D) instead of FloydWarshallWithPaths(D) because its somewhat faster.

Code being vectorized means the inner loops are replaced with matlab commands which make it run faster on a lower level, though the algorithm's time complexity remains O(n^3) where n is the number of nodes.

It's good for dense graphs, while for sparse graphs it's better to use Johnson's algorithm.

See ExampleUsage.m file for how to use.