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!
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!
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!
This is hands-down the best explanation of Dijkstra's Algorithm on UA-cam. 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.
Stellar video with very clear explanations. One of the best videos on UA-cam I’ve seen so far. Credit to the producers of this instructional video. Keep up the great work. Thank you.
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.
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😁❤️
Hi Barngrader, was about to start an explanation in ppt myself for a class, but I am not going to be any clearer than this. Thanks for saving the time!
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
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.
I expect to find at least a nepali on every computer science related video that i'm watching, and almost never go disappointed. . :) . wish you all the best.
Thanks for such a great explanation! I got the full mark from this question on my exam and got 92 in total! Yay! I was wondering whether you can possibly upload a video on Dynamic Programming? I know it has a similar logic of Dijkstra's. Thanks
Short, sweet & comprehensive! Thanks for addressing the scenario where there are 2 of the same distances at 5:24
yeahhhh right!! he is so cool
Yo
Very important in here imo, good thing you pointed this out
hi
Finally understood with clarity, just 1 hour before the exam.
Thank you very much.
me studying after the exam
I have watched some videos on Dijkstra. This one is the best and I am no more confused now. Thank you
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!
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!
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!
Just like the choices of your words in this particular sentence
@@shubhamrathore3735 so pathetic
This is hands-down the best explanation of Dijkstra's Algorithm on UA-cam. 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.
I found your explanation much better than other videos. Thanks. Your voice is so calming as well. That helps. :-)
one day before exam , think what I easily understand your class thank you sir
This is the best explanation of Dijkstra's on UA-cam and quite possibly the entire internet as well!
Thank you thank you thank you! I finally understood this algorithm after watching 10k videos. Your's was the only one explained brilliantly :)
Zelina Wankadiya sad
this is my 3rd video.... but now my concept is clear!
I don't understand
Best video suggest me
This is the perfect video which I was looking for. Simple & Straightforward!
best explaination...short,crisp n clear..u made me understood better than my teachers..thnx a lot sir..
Stellar video with very clear explanations. One of the best videos on UA-cam I’ve seen so far. Credit to the producers of this instructional video. Keep up the great work. Thank you.
The best explanation of Dijkstra Algorithm on UA-cam. Thank You Sir.
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.
Crisp simple and to the point! Great for last minute preps !! Helped a lot because of how easy it was to comprehend. Thank you sir!!
This is a brilliant explanation. Short, clear, easy to follow. Thanks!
Fantastic explanation. So much easier than the one my lecturer taught. Thanks very much!
best explanation (and accent) after going through tons of yt videos. Really comprehensive! Love it
This one is just the definition of perfection , thank you man .
I know you've heard it before.... still gonna say this is the best explanation
What my lecturer is trying to teach in a 2 hours you made me understand under 8 minutes
This is the best video I have seen so far. Thank you very much.
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.
Really good explanation, much better than anything else I've come across so far, thank you!
I have been struggling with this and then I found your video! Thank you!
You unlocked the key to learning with this one. Thank you very much for sharing. You are a life saver.
Best explanation best method best example ever you cleared every doubt about this topic and i am ready for my exams. Thanks alot SIR
Wow this is the simplest explanation of Dijkstra out there! Thank you so much.
This example was clear and not as easy as other videos i have watched, I was looking for a good example like this. Thanks.
Much better explanation than the previous video I watched. Thank You!
I can't explain how amazing the explanation was
this is so much helpful lecture . yoy please carry on my dear !
Well, our teacher just gave us the link of your video for an other explanation of that algorithm. Really nice work, well done !!
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.
Thank you very much. This was very helpful, it's the best and most well-arranged explanation I've found.
this is really one of the best video for dijkstra algo.
determining the final path had a sort of vagueness...it was the most important part of the video!
Thank you Mr Grader, finally a good example to show it to my students !
Thank you very much. This was much easier to understand than both the textbook's explanation (Rosen) and my professor's.
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😁❤️
Extremely helpful. Very clear example. Thank you very much for your contribution.
Love it. it's so easy to understand, and yes less cumbersome. I'd like to add that this is even much better than the one I had in my lecture. LOL
this is the best video so far on the Dijkstra'a algo!!!
I really liked how organized this was.
Thank You !!! You Just Helped Me For My Exam In The Morning !!!
Best explanation of Dijkstra's algorithm ever..
Good job man!! your voice is nice, you present easily to understand!!
This tops it for me for all the videos I’ve watched regarding this algorithm.
Ik this video is 8 years old but still a huge thanks to u for making this video.
explained well, calm with a very deep voice : - )
Easiest to understand of all videos.The example is pretty good
The best video if you want to see an example PERIOD
After two hours I have an exam and I think I am ready now. Hell yeah thank you.
This was really helpful! this video made it much clearer than the original video you did. Both are great though. Thanks so much!!!
> Made a video 8 years ago
> Does eloborate and on point
> Simple af
> leaves
This is best way anyone can make me understand something appreciate it a lot bro!! 😉
The best version of Dijkstra's I've seen
Hi Barngrader, was about to start an explanation in ppt myself for a class, but I am not going to be any clearer than this. Thanks for saving the time!
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
Understood Dijkstra algorithm finally. Thanks.
awesome way of teaching man
thanks for the presentation.
Best explanation, other ways I've seen of breaking this out into a chart are much more confusing and don't add anything.
Understood clearly sir... Clearly explained
Thank you for explaining this in a short and great way!!
Thanks man still the best video out there to explain this, thanks for your help!!!
I bet Dijkstra never had a girlfriend
Very well explained, very direct and precise. Grateful if you could make a video on A* algorithm.
most clearly example I found on youtube!!!
Wow. Freaking phenomenal. Even better than your last video!!!!
thank you man , BRILLIANT explanation !
Thank you very much for this presentation, this video is better than a thousand words! =)
It's a good video from the others. I like your explanation. It makes me understood. Thanks brother. May good bless you
Thanks for a really simple explanation!
Awesome explanation. And finally i learnt Dijkshtra's algorithm. 😂
Hands down, the best explanation for Dijkstra's Algorithm!
The best explanation ever! thank you ! :)
This one is the best vedio on Dikstra
this video is the best in Dijkstra's algorithm
Very good explanation. Thank you!
God level explanation . Thanks a lot sir.
Thank you so much! This video is saviour! You made it so easy.
Thank you very much ! Short and sweet !
awsome ! i'm not abld to get it since class but you explained it in a good manner ... so thanks 🎉
Thanks. You explained very good examples.
Your're simply the Best. Thanks for this
That's amazing! Could you please make a bellman ford? Thanks!
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.
babaal raicha yar!
Meaning: A superb explanation!
Thanks a lot!
I expect to find at least a nepali on every computer science related video that i'm watching, and almost never go disappointed. . :) . wish you all the best.
blommsnruins01u9 lol
u r right bro ..babbal nai cha
hamro exam ko sahara yehi video ta ho ni yrr..
Thanks for explaining so easily.
It was awesome
Thank you so much for this concise explanation.
Thanks for such a great explanation! I got the full mark from this question on my exam and got 92 in total! Yay! I was wondering whether you can possibly upload a video on Dynamic Programming? I know it has a similar logic of Dijkstra's. Thanks
Simple & Comprihesive. Thanks Buddy
Excellent Dude! Clearly understood :)
WOW great video! Your voice is soothing too lol
Best explanation sir!! Thank you!
thank you sir... just cool and tricky.. best of luck
This is very good lecture ! Thank you so much !
Extremely helpful, congratulations and thanks :D