Question

c) Dijkstra's algorithm uses a priority queue data structure. Explain what would be the time complexity of the Dijkstra's algorithm if the priority queue is built using i) array ii) min-heap d) Explain how can you detect if a directed weighted graph contains a negative weighted cycle. State the time complexity that would be required to do so.

          c) Dijkstra's algorithm uses a priority queue data structure. Explain what would be
the time complexity of the Dijkstra's algorithm if the priority queue is built
using
i) array
ii) min-heap
d) Explain how can you detect if a directed weighted graph contains a negative
weighted cycle. State the time complexity that would be required to do so.

c) Dijkstra's algorithm uses a priority queue data structure. Explain what would be
the time complexity of the Dijkstra's algorithm if the priority queue is built
using
i) array
ii) min-heap
d) Explain how can you detect if a directed weighted graph contains a negative
weighted cycle. State the time complexity that would be required to do so.

Added by Robin P.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Tassha Calista

Step 1

This is because finding the minimum element in the array would take O(V) time, and we need to do this V times. Show more…

Show all steps

Thanks for your feedback!

c) Dijkstra's algorithm uses a priority queue data structure. Explain what would be the time complexity of the Dijkstra's algorithm if the priority queue is built using i) array ii) min-heap d) Explain how can you detect if a directed weighted graph contains a negative weighted cycle. State the time complexity that would be required to do so.