What is running time of Dijkstra’s algorithm using Binary min- heap method?
What is running time of Dijkstra’s algorithm using Binary min- heap method? Correct Answer O(ElogV)
Time required to build a binary min heap is O(V). Each decrease key operation takes O(logV) and there are still at most E such operations. Hence total running time is O(ElogV).
মোঃ আরিফুল ইসলাম
Feb 20, 2025