Related Topics
Data Structure
The time complexity of the Floyd-Warshall algorithm is O(n^3), where n is the number of nodes in the graph. The space complexity is also O(n^3), since the algorithm requires a 2D matrix of size n x n to store the distances between all pairs of nodes.
Popular Category
Topics for You
Go through our study material. Your Job is awaiting.