- #1

SadPaul

- 2

- 0

- Homework Statement:
- Prove that Dijkstra's time complexity O(E + VlogV) with Fibonacci priority queue is the best by reducing it to a sorting problem

- Relevant Equations:
- -

**My effort:**

I think that the sorting problem in question is Heap Sort which has an O(logV) complexity, but how can I operate with that information so I can solve this? Can you help me by giving me the outline of an idea?