Floyd–Warshall algorithm
E1119493
UNEXPLORED
The Floyd–Warshall algorithm is a classic dynamic programming method in computer science for efficiently computing shortest paths between all pairs of vertices in a weighted graph, even when negative edge weights are present.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Floyd–Warshall algorithm canonical | 1 |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Robert W. Floyd