Question: I a) Explain very briefly why the breadth first search algorithm takes O(V+E) time b) Explain the advantages and the disadvantages of Bellman Ford

I a) Explain very briefly why the breadth first search algorithm takes O(V+E) time b) Explain the advantages and the disadvantages of Bellman Ford algorithm over Dijkstra's algorithm. c) Use the Dijkstra's algorithm to determine the shortest path from A to all vertices. Clarity is expected while answering this question. Start B 15 10. 15 10 d) Dijkstra's algorithm uses the priority queue data structure. If the priority queue is built using array (and not heap), what would be the time complexity of the Dijkstra's algorithm.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
