The Floyd–Warshall algorithm is a popular method for solving the All-Pair…
Bihar STET · PGT (Paper 2) · Computer Science · 2025
The Floyd–Warshall algorithm is a popular method for solving the All-Pair Shortest Paths problem. What is the time complexity of the Floyd–Warshall algorithm for a graph with 'n' vertices?
- A.
O(n)
- B.
O(n log n)
- C.
O(n²)
- D.
O(n³)
Attempted by 215 students.
Show answer
Correct answer: D
Explore the full course: Bihar Stet Paper Ii Computer Science
Loading lesson…