GATE Computer Science (CS) 2013 Solved Paper
© examsiri.com
Question : 29 of 65
Marks:
+1,
-0
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?
Go to Question: