This is a fantastic approach! Neatly laid out and does not require multiple tables. Thank you so much for posting this. Great timing as well since my final exam is next week!
man this explanation and the notation you use are the best I've seen. I wish they had taught it this way in my class, 'cause the way they explained it there was so atrociously cumbersome and confusing. Thanks for the video!
Very clear and concise explanation and an easy to follow visual presentation. No unnecessary information thrown around, just step by step pure logic! I got it in one shot. Thank you, sir!
This is hands-down the best explanation of Dijkstra's Algorithm on RU-vid. Here's a tip for making it even better: Draw an arrow connecting the bottom of each box towards the bottom of the screen, indicating that the box won't take part in any more calculations.
of the many videos i've seen on Dijkstra so far, this is the best -- because it gives an explicit method for tracking not just the final weight of the shortest path but also recovering the path itself through the subscripting and boxing mechanism. thanks.
Stellar video with very clear explanations. One of the best videos on RU-vid I’ve seen so far. Credit to the producers of this instructional video. Keep up the great work. Thank you.
Very nice explanation, thanks, i put this box around it on a test, but following your first video guidelines, and it worked, this one is even better, thanks again.
Best explanation I've seen yet. If every presenter first explained the goal of the algorithm before demonstrating it, and proceeded to justify their steps in the context of this goal, they might produce explanations as understandable as yours.
Ayo, the first time I saw this on my A level computing I was flabbergasted at first, I couldn’t do it, I didn’t understand it until I saw your video. Man thanks sooo much, u helped me tremendously🙏🏾. Thanks bro, i understand it perfectly now😁❤️
just note, when implemented by priority queue, you add duplicities with different key values, because priority queue doesn't have key decrease. so when inspecting C you already have in queue =(D_5, B_8) after update you have (D_4, D_5, C_7, B_8)
You'll have to define your terminology for me to understand and comment....What do you mean by "priority queue?" when I'm inspecting C, I do not already have 5D (which I assume is what you mean by D_5).....I just have 7C....
@@barngrader _, so D_5 is eq. tuple( class of two variables, ..) in my priority queue saying Node 'D' with cost=5. By priority queue I mean the priority queue, the data structure where I keep my candidates on next node node to be add to closed ones, sorted by their cost, to choose the cheapest one each iteration.
Thanks a lot thats very good explanation You cleared all my confusions Selected Good question/example for explanation it include almost all conditions Thank You again
