Please tell me Time and Space complexity of Dijkstra Algo
taught by Sir in clear steps.
Dijkstra......Time Complexity
(Time and space complexity are O((V+E)logV) and O(V+E).
This is because we can have atmost (V+E) entries into priority queue(or set) and each insertion/deletion taking logarithmic complexity.
How atmost (V+E) entries ,can you explain clealy ,I have doubt.
@Bhawna it is possible that a single node has multiple entries(when you use priority queue), this depends upon number of edges.
However when we use set, we first delete the previous entry for given node and then add new entry!
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.