In the following table, the left column contains the names of standard graph…
GATE · 2005 · IT
In the following table, the left column contains the names of standard graph algorithms and the right column contains the time complexities of the algorithms. Match each algorithm with its time complexity.
1. Bellman-Ford algorithm | A : O ( m log n) |
2. Kruskal’s algorithm | B : O (n3) |
3. Floyd-Warshall algorithm | C : O (nm) |
4. Topological sorting | D : O (n + m) |
- A.
1→ C, 2 → A, 3 → B, 4 → D
- B.
1→ B, 2 → D, 3 → C, 4 → A
- C.
1→ C, 2 → D, 3 → A, 4 → B
- D.
1→ B, 2 → A, 3 → C, 4 → D
Attempted by 108 students.
Sign up free to check your answer
Sign up freeLoading lesson…