Dijkstra's Algorithm Single Source Shortest Path Graph Algorithm

Find single source shortest path using Dijkstra algorithm

[niteshgyanani]

Aapse acha teacher aaj tak nhi dekha...itna ache se kisi ne nhi smjhaya ye sab...you are really good ❤️❤️

[sidhantakumarpattnaik]

You are awesome .I viewed almost all videos and its clear my concept , which not being cleared by seeing other videos .
Keep posting new videos and this will help us .

[sunnykeshshandilya]

Awesome man. You make any algorithms so easy and teaches 3hr things in 15 mins and concept given is very solid. One small thing missed in video.. explanation for time complexity O(E log V)

[Dreamazium]

You do seem to be able to explain things much better than others. Uni is rubbish at explaining things while you have given me at least given me a chance of understanding it.

It seems much simpler now you have explained it. Thank you.

[BackToBackSWE]

Loved the video. This was a fundamental concept in our Object Oriented 2 class.

[wth]

I`m student in korea. Your good explanation Thanks Tushar Roy~

[AvaisAhmad]

I really liked your videos.
Can you please upload videos on some of following topics?
->asymtotic complexity
-> n queen problem
->travelling salesman problem
->karp-rabin
->strassen matrix multiplication
->randomized algorithms las vegas and monte Carlo
->Amortized analysis
->LC Branch and Bound
->FIFO Branch and Bound
->Multistage Graph
->Flow Shop Scheduling
->binomial heap
->fibbonaci heap

[anamigator]

If you are still guessing, why the O(E log (v)) complexity, here is an explanation. You visit each edge in this graph at-least once (without which you cannot reach all the vertices). That would be O(E). However, at each edge, you are looking at the priority queue (heap) and doing an extractMin() operation which takes log(n) time in general, for n elements in the heap. Since in the worst case, you will have as many as V elements in the heap, each edge traversal means, a O(log V) time to extractMin from the priority queue(heap). So E times log(v).

[harjos]

One of the best and simplest videos for understandng dijkastra's algo.. Hats off Tushar... Great work!

[ayush]

Very nicely explained, especially the complexity part. I could not understand that from other sources. thank you!!

[blazingsniper]

you helped me in bachelors and need you again in masters god bless you

[edmondshek]

Roy's doing things for global audience, I benefit a lot from his videos as a Chinese student.

[jonathanbain]

absolutely fantastic explanation! Thank you so much for going through even the most obvious bits as now I have a -rough- idea of how i'm actually going to implement part of my algorithmics C assignment! cheers.

[CabCallawayMusic]

The other videos explaining the algorithm aren't bad, but this is the best one when trying to understand the pseudo code and data structures - thanks!

[DentrifixoRam]

I just looked for a video from you about Dijkstra. You're the best teacher I've found in YouTube.

[rafamassa]

First Dijkstra's explanation ever that allowed me to visualize the data transformations!

[wahmed]

Dude, these lessons are really simple and easy to grasp.
Thanks a lot, definitely helping me in my quiz tomorrow!! KEEP IT UP! :)

[mibo]

Thanks God man. you saved me from quitting learning...

[GabrielaSwanson]

Great video! Thank you so much for your clear explanations and demonstrations.

[kaushalgala]

Watched many of your videos, and most of these videos are well explained - good for freshers to computer science, as well as those who want to dust up academics in preparation for new opportunities. Want to commend you on all your great efforts.