Before I found your video I watched and read probably 10 different articles and videos on Dijkstra’s and had about 0 understanding. All I had to do was watch your video one time and I was able to work it out and implement it completely, thanks so much.
Was this video helpful? Which algorithm do you want me to cover next? 💻👇 0:00 Introduction 0:30 Example 7:15 Backtracking the shortest path from A to C
It is more than 100% helpful sir. Honestly speaking we have understood the whole concept behind the Dijkstra's algorithm within a very short period of time. May you do the same for other algorithms like: Bellman-Ford Floyd Warshall Johnson's Algorithm and even A star search please This is from University of Malawi.
Honestly speaking, this has been helpful. We have understood the whole concept behind the Dijkstra's algorithm within a very short period of time. Thanks a lot sir.
Thank you, you worked hard to bring together this animation and you covered different use cases. Fantastic. I was struggling with my professor's explanation. The other TH-cam videos were better than my professor's, but your's is the best.
Thanks,,, now I can understand the Dijkstra’s algorithm in the context of how data packets from a certain host try to find their shortest way to reach their destination via the shortest route possible. 😊❤😊
thankyou so much my professors made this so hard for me on my exam i was about to leave this topic then I watched your video, and now I am very confident about this topic that I gonna do it 100 percent
If you're interested in all the shortest paths, than, you can acumulate in "previous node" all the nodes with the same minimal distance to the given node. Final result will be an adjency list of a directed graph that, when transversed by, lets say, depth first search, will give you all the shortest paths from the especified pair of nodes.
Thanks a lot man. You explained it in such a easy way and the animations helped a lot in understanding. Definitely explained so much better than those videos on top of the search list
Thank you so much for all your content. I struggled a lot to understand data structure and your videos certainly put that on end. you are doing great job there.
real clear, good shit my guy. this is a slightly weird one though: we haven't found *THE* shortest path from A to C, we've found *A* shortest path from A to C. [ABEFC also gives 12.]
You don't actually need to record the previous node to reconstruct the path. Starting from C, the path through F to A is 3+9 units long while going through E takes 8+9 units long. Thus go through F. This logic can be repeated until A is reached.
If you were to count the numbers of insert how would you do that? Would you count a the start node and would you also count if two nodes get the same distance but different paths as two or one??🥺
Amazing and effortless elucidation of Dijkstra. Thanks so much, I wish that you'd teach Bellmann Ford. Thanks a lot! One more subscriber you've gotten. Welldone
I've got a question but it needs to be teed up first: I assume that when you go to implement this algorithm, you repeat this analysis and make a similar table for all of the other nodes. Each node then has a corresponding table. If you want the shortest path between, for example, node P and node X, you'll begin with the table for node P. That table might tell you to go to node R first. My question is: on your route to X, do you continue operating from the table for node P the whole time or do you switch to the table corresponding to whatever current node you're at (node R in this example)? Or does it even matter-will you get the same distance either way?
The day I succesfully graduate from my CS major, you'll be in the list of persons I'm grateful with
This is absolutely the most clear video on Dijkstra's algorithm. Thank you!
Before I found your video I watched and read probably 10 different articles and videos on Dijkstra’s and had about 0 understanding. All I had to do was watch your video one time and I was able to work it out and implement it completely, thanks so much.
That was - in my opinion - way better and especially easier explained than every other video that was on the top of the list
This is the clearest explanation to this algorithm I've ever encountered with.
Was this video helpful? Which algorithm do you want me to cover next? 💻👇
0:00 Introduction
0:30 Example
7:15 Backtracking the shortest path from A to C
It is more than 100% helpful sir.
Honestly speaking we have understood the whole concept behind the Dijkstra's algorithm within a very short period of time.
May you do the same for other algorithms like:
Bellman-Ford
Floyd Warshall
Johnson's Algorithm and even A star search please
This is from University of Malawi.
This video is simple and straight forward. We have really liked it
you should ping this
Honestly speaking, this has been helpful.
We have understood the whole concept behind the Dijkstra's algorithm within a very short period of time.
Thanks a lot sir.
Thank you, you worked hard to bring together this animation and you covered different use cases. Fantastic. I was struggling with my professor's explanation. The other TH-cam videos were better than my professor's, but your's is the best.
💀 I am not a computer science student but boy did I enjoy learning this (aim a pharmacy student I don't know why I watched this)
😂 bruh
Ain't no fking way blud did that 💀
Go to the laboratory this is not for you
Bruh 😂
Use it in finding the shortest way to ur school 😂.....I tried but due to negative weights, couldn't complete
the step by step demonstration of this algorithm made it clear to me. thanks❤
This is the best dijkstras explanation on youtube
Thanks,,, now I can understand the Dijkstra’s algorithm in the context of how data packets from a certain host try to find their shortest way to reach their destination via the shortest route possible. 😊❤😊
This is the best explanation I found of Djikstra! And the only one so far that has explained how to reconstruct the original path!
Thanks a lot!!
Without a doubt, the best explanation of Dijkstra algorithm on TH-cam.
Thanks a lot :)
Wow, I just installed the algorithm to the brain in 8 minutes🧠. Thank you, Sir.
Tomorrow is my Design amd Analysis of Algorithms exam, your videos on quick, merge sort and now this have been really helpful. Thanks man.
Good luck with the exam :)
@@FelixTechTips I think I did well, feels good ending the semester like this ( ◜‿◝ )
@@williamhogrider4136 Let's go! 🚀
So simply and beautifully explained. I went through several videos on this topic and you are on the podium.
thankyou so much my professors made this so hard for me on my exam i was about to leave this topic then I watched your video, and now I am very confident about this topic that I gonna do it 100 percent
This was the final puzzle piece I needed for an Advent of Code challenge. Thank you!
The best explanation I've come up so far. Bravo!
I have watched more than 10 video's here on TH-cam, but this video made me understand it. Chapeau Felix!
i have never find the video very helpful than this Dijkstra's Algorithm thanks A lot
I like the example graph you make. With doesn't make it find the best in the first search, it makes me understand better
Wow very clear! I love this human way of simplifying technical stuff!
It seemed like you were Dijkstra's himself explaining your algorithm! Really helped me prepare for my interview :)
Great explanation, verbally and visual.
This is the best video on djikstras algo ..trust me
Thanks for the explaining the Dijkstra algorithm so well. 😊😊
Best explanation man!! Now my concept is crystal clear.
THANK YOU VERY MUCH KIND SIR! U JUST DONT KNOW HOW MUCH OF A HELP U'VE BEEN! GOD BLESS
Thank you! This was a great explanation and demonstration. The explanation in my textbook made no sense at all. This was so helpful!
Thank you, this is the best explanation on Dijkstra's. Very clear and precise, and I can easily code them in a computer language.
Thanks a lot for explaining this graphically instead of with code in simple terms.
Thank you. This is much easier to understand than the nightmare full of math notation our professor wrote. I hate academics so much
Best explanation on youtube. Thanks
Thank you :)
Awesome explanation of Dijkstras Algorithm
The best explanation of Dijkstra algorithm, Thank you
Excellent and lucid explanation. Best video on youtube for dijiksta algorithm
Amazing explanation! Such a detailed, yet simple illustration of the Dijkstra's algorithm.
I also found that it has the same distance with the path: A->B->E->F->C which has a total of 12
If you're interested in all the shortest paths, than, you can acumulate in "previous node" all the nodes with the same minimal distance to the given node. Final result will be an adjency list of a directed graph that, when transversed by, lets say, depth first search, will give you all the shortest paths from the especified pair of nodes.
absolutely awesome. this is the best video i found about dijkstras shortest path algorithm in youtube. Thanks man. simple and neat.
Very clear explanation. Thanks for sharing your knowledge!
Thank you so much, can understand fastly and exactly regarding Dijkstra’s algorithm.
I watched another video before this one and I didn't understand it. but now I do thanks for the explanation.
Thank You for this concise explanation of Dijikstra algorithm. I still need to look at it a few more times though.
Finally found this method...i was looking for this one❤
I am not understanding in text book but ur explanation is excellent
I loved your explanation, so easy to understand. Thank you!
100/100 explaining , thank you so much
Best explanation video ever. Thank you good sir
Thanks a lot man. You explained it in such a easy way and the animations helped a lot in understanding. Definitely explained so much better than those videos on top of the search list
Thank you :)
One of the best video so far.
Thank you so much for all your content. I struggled a lot to understand data structure and your videos certainly put that on end. you are doing great job there.
real clear, good shit my guy. this is a slightly weird one though: we haven't found *THE* shortest path from A to C, we've found *A* shortest path from A to C. [ABEFC also gives 12.]
Yes, but how can I make the computer understand that? Is it too bad that the algorithm can't fathom other paths?
Thank you so much, i hope to find other topics for this course on your channel, because I liked the way of explanation.
thank you for this great video! I finally understand djikstras algorithm
masterclass, you should make videos again
Thanks. I'm planning to make videos again :)
Perfect man Thanks so much you saved my course
You don't actually need to record the previous node to reconstruct the path. Starting from C, the path through F to A is 3+9 units long while going through E takes 8+9 units long. Thus go through F. This logic can be repeated until A is reached.
Best video i found on this algorithm so far, thanks a lot
If you were to count the numbers of insert how would you do that? Would you count a the start node and would you also count if two nodes get the same distance but different paths as two or one??🥺
Most clear explaination.
Thank you so much for this explanation, one of the best In have seen so far.
Hey! Thank you Felix, for the easy and crisp explanation.. I Appreciate it
it helped me understanding the algorithm. thank u very much
Very clear and effective approach
Thank you very much! clear speaking... best video about Dijkstra's also so far!!!
Thank you so much sir, this video helps me a lot! It makes the algorithm much easier to understand.
Finally I understand this algorithm, thank you.
Thanks. It is great tutorial and easy to understand
That was a brilliant explanation, you just made it easy to understand. Thank you.
Thank you so much for your clear explanation. It is straight to the point, easy to understand, therefore, really helpful for me.
Amazing and effortless elucidation of Dijkstra. Thanks so much, I wish that you'd teach Bellmann Ford. Thanks a lot! One more subscriber you've gotten. Welldone
Awesome. Was confusing on w3schools, and this really helped.
I've got a question but it needs to be teed up first:
I assume that when you go to implement this algorithm, you repeat this analysis and make a similar table for all of the other nodes. Each node then has a corresponding table. If you want the shortest path between, for example, node P and node X, you'll begin with the table for node P. That table might tell you to go to node R first. My question is: on your route to X, do you continue operating from the table for node P the whole time or do you switch to the table corresponding to whatever current node you're at (node R in this example)? Or does it even matter-will you get the same distance either way?
beautifully done. this is a work of art.
thanks Felix, explained very well
This is really impressive
Simple and Brilliant. Thank you sir
Wonderful video! Very helpful! Thank you!❤
Thank you. Brilliantly explained.
Just right at my Hippocampus thank you.
the best ever I salute to this one thanks sir
Very very good explanation.
You are the best
Thank you very much indeed. l was strugling to understand this now it is easy to me
Thank you for well explanation 👍
very good explanation! thanks
Thanks a lot had trouble understanding this concept you cleared the jam
Very clear indeed 👌..
Thank you 😊
Amazing video, easy to follow and very clear.
Man keep uploading!
Im planning to upload again next year. Do you have any specific problems you need help with?
Very clear and to the point explained, vielen Dank!!
Thank you for helping me understand this algorithm
yes this video helped. thank you for doing this!
Awesome content. You explained it so well. Kudos!
Very helpful video cheers
Good and well explained.
Love you man. Beautiful explanation.
thank you broo
it really helps me
Thank you and best explanation for starters