1.

The time complexities of some standard graph algorithms are given. Match each algorithm with its time complexity? (n and m are no. of nodes and edges respectively)a. Bellman Ford algorithm b. Kruskals algorithm c. Floyd Warshall algorithm d. Topological sorting 1. O (m log n) 2. O (n3)3. O(mn) 4. O(n + mCodes:a b c d

A. 2 4 3 1
B. 3 4 1 2
C. 2 1 3 4
D. 3 1 2 4
Answer» E.


Discussion

No Comment Found

Related MCQs