Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.geeksforgeeks.org/dsa/time-and-space-complexity-of-floyd-warshall-algorithm/ below:

Time and Space Complexity of Floyd Warshall Algorithm

Last Updated : 23 Jul, 2025

The Floyd Warshall Algorithm has a time complexity of O(V³) and a space complexity of O(V²), where V represents the number of vertices in the graph. This algorithm computes the shortest paths between all pairs of vertices in a weighted graph. The time complexity arises from the triple nested loops used to update the shortest path matrix, while the space complexity is determined by the need to store the distances between all pairs of vertices in a 2D array.

Let's explore the detailed time and space complexity of the Floyd Warshall Algorithm:

Best Case: O(V³)

• In the best-case scenario, the algorithm completes all iterations of the nested loops without any relaxation steps needed.
• This implies that the shortest paths between all pairs of vertices are already determined and no updates are necessary.
• Because of this, the three nested loops each of which iterates through every vertex—are the only factors influencing the algorithm's time complexity.
• With V vertices, each loop iterates V times, resulting in a time complexity of O(V³) for the best case.

Average Case: O(V³)

• The average-case time complexity of the Floyd-Warshall algorithm is also O(V³).
• This complexity holds true across various graph structures and densities, as the algorithm's performance primarily depends on the number of vertices and the number of iterations needed to compute shortest paths between all pairs of vertices.
• The algorithm's inherent nature of iterating through all pairs of vertices and updating distances contributes to the cubic time complexity, regardless of the specific graph characteristics.

Worst Case: O(V³)

• Conversely, in the worst-case scenario, the algorithm performs relaxation steps for each pair of vertices during all iterations of the nested loops.
• This means that the algorithm needs to update distances between vertices multiple times until the shortest paths are determined.
• Again, the time complexity is determined by the three nested loops, each iterating through all vertices.
• With V vertices, each loop iterates V times, resulting in a time complexity of O(V³) for the worst case as well.

The auxiliary space complexity of the Floyd-Warshall algorithm is O(V²), where V is the number of vertices in the graph. To create a 2-D matrix in order to store the shortest distance for each pair of nodes.

Distance Matrix: Utilizes a 2D array to store shortest distances between all pairs of vertices.

• Matrix size: V x V, where V is the number of vertices.
• Each entry represents the shortest distance between two vertices.
• Space complexity: O(V²).

Additional Variables: May require supplementary variables for iteration and calculation.

• Space occupied by these variables is typically minimal compared to the distance matrix.
• Doesn't significantly affect overall space complexity.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4