Time complexity of dijkstra algo

#1

Could you please explain the time complexity of dijkstra algo ?

#2

if implementing dijkstra algorithm using priority queue and adjacency list-;
you will get time complexity of O((v+e) log(v)).

when number of edges e is greater than v then we can neglect v , therefore total complexity is
O(e log (v))

#3

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.