Glossary: Algorithms Beyond the Basics in C++

Floyd-Warshall

An algorithm that finds the shortest path between every pair of places in a weighted graph. It runs in O(V³) time for V places.