Floyd-Warshall algorithm
Description: A graph algorithm for finding shortest paths between every pair of vertices, including graphs with negative edge weights.
Primary topic: Complexity and Algorithms in Graphs (29%)
Related topic: Complexity and Algorithms in Graphs (29%)
Wikidata ID: wiki/Q1047576
OpenAlex ID: keywords/floyd-warshall-algorithm
