Dijkstras Shortest Path Algorithm Explained | With Example | Graph Theory

I explain Dijkstra's Shortest Path Algorithm with the help of an example.
This algorithm can be used to calculate the shortest distance between one node and every other node in a weighted graph.
If you want to learn more about algorithms, check out my Basic Algorithms in Python Playlist and subscribe to this channel.

[@samueltapia542]

The day I succesfully graduate from my CS major, you'll be in the list of persons I'm grateful with

[@khalidhussein8311]

💀 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)

[@divinechijindu7465]

😂 bruh

[@infantalenency3561]

Ain't no fking way blud did that 💀

[@Stannya]

This is absolutely the most clear video on Dijkstra's algorithm. Thank you!

[@a0b9180]

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 KZbin videos were better than my professor's, but your's is the best.

[@teflonczmotherboard4551]

Wow, I just installed the algorithm to the brain in 8 minutes🧠. Thank you, Sir.

[@FelixTechTips]

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

[@tsankhulojamson5970]

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.

[@tsankhulojamson5970]

This video is simple and straight forward. We have really liked it

[@spongebobpopsicle9397]

you should ping this

[@trockenfruchte468]

That was - in my opinion - way better and especially easier explained than every other video that was on the top of the list

[@realjoker1568]

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!!

[@tsankhulojamson5970]

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.

[@aliyuumargumel7869]

This is the clearest explanation to this algorithm I've ever encountered with.

[@aidenstephens2232]

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.

[@bekakbarovich7857]

The best explanation I've come up so far. Bravo!

[@dhmacher]

This was the final puzzle piece I needed for an Advent of Code challenge. Thank you!

[@himu1901]

Best explanation man!! Now my concept is crystal clear.

[@nameme2745]

Thank you, this is the best explanation on Dijkstra's. Very clear and precise, and I can easily code them in a computer language.

[@ww-ko1ji]

the step by step demonstration of this algorithm made it clear to me. thanks❤

[@lakindusadumina150]

absolutely awesome. this is the best video i found about dijkstras shortest path algorithm in youtube. Thanks man. simple and neat.

[@doesntmatter6827]

Amazing explanation! Such a detailed, yet simple illustration of the Dijkstra's algorithm.

[@SkySentry7]

THANK YOU VERY MUCH KIND SIR! U JUST DONT KNOW HOW MUCH OF A HELP U'VE BEEN! GOD BLESS

[@vv6533]

Excellent and lucid explanation. Best video on youtube for dijiksta algorithm

[@saquibsaiyyed6745]

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.

[@kagisomosehla4647]

That was a brilliant explanation, you just made it easy to understand. Thank you.

[@ahmadalastal5303]

The best explanation of Dijkstra algorithm, Thank you

[@sorinoltean7511]

Great explanation, verbally and visual.

[@nilsodor]

Wow very clear! I love this human way of simplifying technical stuff!

[@ryanpark4856]

are u not human.

[@georgeoneal3641]

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

[@stoup8778]

This is the best dijkstras explanation on youtube

[@nydexia4789]

Thanks a lot for explaining this graphically instead of with code in simple terms.

[@GonaLEE]

Thank you so much, can understand fastly and exactly regarding Dijkstra’s algorithm.

[@biaoalex2018]

Thank you so much sir, this video helps me a lot! It makes the algorithm much easier to understand.

[@43_ayonroy4]

Best video i found on this algorithm so far, thanks a lot

[@lalith_kumar_akhila2411]

Hey! Thank you Felix, for the easy and crisp explanation.. I Appreciate it

[@MoMo-ue9ff]

Thank You for this concise explanation of Dijikstra algorithm. I still need to look at it a few more times though.

[@abdoulhamidzeba9257]

Thank you so much for this explanation, one of the best In have seen so far.

[@atomicCache_]

Thanks for the explaining the Dijkstra algorithm so well. 😊😊

[@Rigel_Kuriom_Mandara]

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. 😊❤😊

[@sebastianmontano2148]

Thank you very much! clear speaking... best video about Dijkstra's also so far!!!

[@catalinalebedina5965]

Amazing video, easy to follow and very clear.

[@theoxc]

Very clear and to the point explained, vielen Dank!!

[@mina.corner]

Thank you so much for your clear explanation. It is straight to the point, easy to understand, therefore, really helpful for me.

[@anandmaha1]

beautifully done. this is a work of art.

[@navinagrawal1963]

Awesome content. You explained it so well. Kudos!

[@mikhailwebb8377]

Without a doubt, the best explanation of Dijkstra algorithm on KZbin.

[@FelixTechTips]

Thanks a lot :)

[@justjerono]

Best explanation video ever. Thank you good sir

[@vishalkarna3763]

Awesome explanation of Dijkstras Algorithm

[@davideriemma180]

Very clear and effective approach

[@ShitritarielChannel]

100/100 explaining , thank you so much

[@TheMountainBeyondTheWoods]

Finally I understand this algorithm, thank you.

[@imanghavasieh5366]

Wonderful video! Very helpful! Thank you!❤

[@hudahamed9658]

Thank you so much, i hope to find other topics for this course on your channel, because I liked the way of explanation.

[@jerryrockson7023]

Simple and Brilliant. Thank you sir

[@mahboub1982]

Very very good explanation. You are the best

[@winniethepoop917]

it helped me understanding the algorithm. thank u very much

[@RAN-os5gz]

Thank you for helping me understand this algorithm

[@xinyue6895]

thank you for this great video! I finally understand djikstras algorithm

[@radomeditv]

very clear, very helpful. Thank you !

[@ashkantaherizadeh8476]

Perfect man Thanks so much you saved my course

[@adeelarif2266]

Love you man. Beautiful explanation.

[@Rajivrocks-Ltd.]

Very clear and concise!

[@dreb.7760]

thanks Felix, explained very well

[@Diablo1313-]

Thank you! This is an amazing explanation

[@mahirtaz3729]

great job! wonderful explanations.

[@nathanmakwara9207]

Thanks a lot had trouble understanding this concept you cleared the jam

[@leeschloss4840]

Awesome. Was confusing on w3schools, and this really helped.

[@SamuelNKiap]

Thank you and best explanation for starters

[@icalized6357]

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

[@FelixTechTips]

Thank you :)

[@mazenmagdimohamedahmedmors6989]

everything was so clear! AMAZING! c:

[@harisansari8876]

very good explanation! thanks

[@zabitaguliyeva9992]

Thank you very much indeed. l was strugling to understand this now it is easy to me

[@deyoz1]

Most clear explaination.

[@brandoncazares8452]

Thanks sir. It's really helpful and fantastic.

[@faribasoltani8268]

Thank you for this great tutorial.

[@amalsalim88]

yes this video helped. thank you for doing this!

[@sunr8152]

Thanks sir! Great video.

[@saberkazeminasab6142]

Thanks a lot. Great presentation!

[@AsifKhan-qm4ji]

Thank you for well explanation 👍

[@trinether_alt550]

Thanks, clear and concise.

[@christophernoble8284]

Best explanation on youtube. Thanks

[@FelixTechTips]

Thank you :)

[@danielriley3618]

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?

[@derricklove5744]

God bless you, extremely helpful video

[@j.rubengomez35]

Very good explanation!

[@petersonkariuki8300]

Good and well explained.

[@DarkKnight_2324]

Great explanation!

[@krzysztofkondracki7967]

Very helpful video cheers

[@adjoamirekuaaansong5586]

This was soo helpful . thank you

[@miso-ge1gz]

Thank you. This is much easier to understand than the nightmare full of math notation our professor wrote. I hate academics so much

[@samer820]

Clear and compact 👍

[@artmispotter3571]

thanks for the amazing explanation man

[@muralikrishnay2734]

This is really impressive

[@igit7745]

Is it possible to determine the shortest route from other nodes (instead of the starting node) to another one? For example, we started @ Node A, and I want to determine the shortest path from Node E to C.

[@mohammedamran143]

Thank you so much, you are great.

[@SumagaysayVinceZ.]

thank you broo it really helps me

[@SakshiSingh-de9of]

Excellent explanation :)

[@pushandeb187]

this is quite good...thanks a lot

[@dasturchi5107]

Fantastic bro, thanks a lot

[@talal7805]

this is very helpful. thanks !!

[@user-sq6co7jt6u]

I also found that it has the same distance with the path: A->B->E->F->C which has a total of 12

[@joaobaptista4610]

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.

[@strakerzy5044]

Great explanation.

[@Rajath_2001]

Thank you so much, it was helpful

[@princebillygrahamkarmoker2122]

Just right at my Hippocampus thank you.