UGC-NET | UGC NET CS 2016 Aug – III | Question 36
Match the following:
(A) (1)
(B) (2)
(C) (3)
(D) (4)
Answer: (C)
Explanation:
- Prim’s algorithm takes O(E lgV) time.
- Bellman-Ford algorithm takes O(V2E) time.
- Floyd-Warshall algorithm takes O(V3) time.
- Johnson’s algorithm takes O(VE lgV) time.
So, option (C) is correct.
Quiz of this Question
Last Updated :
13 Apr, 2018
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...