What is running time of Dijkstra’s algorithm using Binary min- heap method?
A. O(V)
B. O(VlogV)
C. O(E)
D. O(ElogV)
Answer:D
What is running time of Dijkstra’s algorithm using Binary min- heap method?
A. O(V) B. O(VlogV) C. O(E) D. O(ElogV)