graph/floyd_warshall_utils library

All-pairs shortest paths (Floyd–Warshall) — roadmap #536.

Functions

floydWarshall(WeightedAdjacency graph) → List<List<double>>

Returns distance matrix where row i, column j gives shortest path i→j (infinity if none).