So far the best explanation I've seen of this algorithm on RU-vid as most people leave out the fact that you need to store the best parent node of how you got to the node, then follow the parents backwards from the end to the beginning to actually find the path you wanted. Good work.
Excellent explanation! What was lacking in the previous videos I checked from different sources is the final explanation of how to backtrack the road from point a to g! Great!
Thank you so much for posting such a great, easy to follow, and very clear interpretation of Dikra's Algorithm! This was very useful in studying for tests!
I have posted a second example of Dijkstra's algorithm, using modified notation that is slightly less cumbersome. : ) It is called "Dijkstra's Algorithm: Another example."
omg so helpful!!! I have been looking for this kind of teaching video for few hours and this one is the most helpful one!! clear and really really helpful!! thank you!
Thanks, such a great explanation. Wish if youtube brings this video as a first result when searching for Dijkstra-Algorithm because it concludes everything.
Best one, if wants an algorithm for this and make a quick code solving it. I just create my C++ implementation using this and works well. Was easy to implement because you described it the way computer thinks. Thanks.
Very good video, one of the best I have seen on this topic, but it would be helpful if you use a color that is more contrast to black ( instead of blue) because on some screens ( combined with bad eyes ) blue looks like black :)
Hello. Sir, why do you do not have "e" at vertices column? You have vertices as follows: a,b,c,d,f in vertices column, but you do not have "e" there. Why it is so?