Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsShortest path algorithms

Floyd–Warshall algorithm

Running time

Report a typo

For a graph $G$ with $n$ nodes, the running time of the Floyd-Warshall algorithm is ...

Select one option from the list

O(n^2)

O(n^3)

O(n \log n)

O(n)

___

Create a free account to access the full topic