What will be the time complexity of Dijkstra algorithm using sets as done in this video? explanation?
Time complexity
@ime_mya it will be O((n+E)logn) where n is number of nodes and E is number of edges.
This is because there can be atmost n+E updates and a set can contain atmost n elements, so cost of each update is logn.
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.