Graph Data Structure 4. Dijkstra’s Shortest Path Algorithm

Поділитися
Вставка
  • Опубліковано 5 сер 2024
  • This is the fourth in a series of computer science videos about the graph data structure. This is an explanation of Dijkstra’s algorithm for finding the shortest path between one vertex in a graph and another. Indeed, this explains how Dijkstra’s shortest path algorithm generates a set of information that includes the shortest paths from a starting vertex and every other vertex in the graph. It also mentions why Dijkstra’s shortest path algorithm is an example of a greedy algorithm.

КОМЕНТАРІ • 818

  • @daringdarius5686
    @daringdarius5686 4 роки тому +896

    I don't know if you know this, and this is 4 years late, but this is one of the cleanest, easiest to understand video's (conceptually-wise) for Dijkstra's.
    I've seen several, but this! This is the best one. :)

    • @ComputerScienceLessons
      @ComputerScienceLessons  4 роки тому +81

      Great to hear! :)KD

    • @vijayalakshmi0714
      @vijayalakshmi0714 3 роки тому +8

      @@ComputerScienceLessons lol, but i'm listening even now, best explanation. Keep it up

    • @eatbreathedatascience9593
      @eatbreathedatascience9593 2 роки тому +3

      I agree fully. Best !

    • @tudorradu5848
      @tudorradu5848 Рік тому +2

      @@ComputerScienceLessons He's right! It was veryyy easy to understand. Thank you

    • @555aboud
      @555aboud 6 місяців тому

      stunning, clear explanation. Thank you so much!!!

  • @assansanogo1343
    @assansanogo1343 7 років тому +1312

    FINALLY SOME CLEAR STUFF. almost crying

  • @royazut550
    @royazut550 7 років тому +263

    !!!finally a good and simple explanation
    oh tears of joy...
    may the gods bless you with bugless codes

    • @neelparekh9846
      @neelparekh9846 4 роки тому +7

      "May the gods bless you with bug-less codes."
      I'm going to use that a lot.

    • @neptechbyte
      @neptechbyte 3 роки тому

      haha epic comment bro

  • @SouravendraKrishnaDeb
    @SouravendraKrishnaDeb 4 роки тому +555

    We won't be visiting A, again.
    Me: CRIES LOUDLY

  • @adityapappu4963
    @adityapappu4963 4 роки тому +151

    This is literally one of the cleanest, simplest, no-nonsense beautiful explanations of an algorithm I have ever watched on UA-cam. Amazing. To-the-point. Crisp. And so easy to understand and digest. THANK YOU.

  • @reiniervanleeuwen9815
    @reiniervanleeuwen9815 5 років тому +118

    This has to be the best explanation of Dijkstra's Shortest Path algorithm... Thanks a lot!

  • @ComputerScienceLessons
    @ComputerScienceLessons  7 років тому +86

    Hi FTP
    My scenario is for a non-directed graph (you can go backwards and forwards on any edge), so all the nodes can indeed be reached. However, for a directed graph, some nodes may be unreachable from the given start, as you have intimated. Dijkstra's algorithm finds the shortest paths only to the nodes that can be reached from the starting node. (if there is no path to a node from the start, it's irrelevant). The loop will end when all 'reachable' vertices have been visited. By the way, Dijkstra's algorithm doesn't work if the graph edges have negative weights.

  • @faisalsal1
    @faisalsal1 2 роки тому +8

    This video is your shortest path to learn Dijkstra Algorithm.

  • @johnstorm589
    @johnstorm589 Рік тому +9

    Even 6 years later, this is still the best explanation ever

  • @amine_fadssi
    @amine_fadssi Рік тому +18

    The best video on the internet explaining the Dijkstra’s algorithm, thanks a lot sir.

  • @TANEM315
    @TANEM315 7 років тому +15

    You sir are BY FAR the BEST teacher of algorithms on UA-cam or anywhere else I've seen algorithm lectures. THANK YOU FOR POSTING THIS! With your well-paced, methodical style you could probably teach anything!!!!

  • @Jbbubanic5434
    @Jbbubanic5434 Рік тому +3

    I can't believe how well done this video was made. I appreciate your hard work at a visual representation of this algorithm.

  • @mikefriedman9573
    @mikefriedman9573 5 років тому +20

    Absolutely the best explanation. Cleared up any and all lingering questions in my mind.

  • @matthewsattam1982
    @matthewsattam1982 7 років тому +96

    Extremely clear, extremely well put together visually. Well done, and thank you.

  • @hadeneh
    @hadeneh 6 років тому +169

    I signed in just to like this video.

  • @timuralmamedov1900
    @timuralmamedov1900 6 років тому +3

    Great explanation! Finally, I understood it. The table really helps to not get lost. Thank you so much!

  • @taruchitgoyal3735
    @taruchitgoyal3735 10 місяців тому +5

    I haven't found a better tutorial than this for understanding and computing distances using Dijkstra's algorithm. Thank you so much.

  • @markh1791
    @markh1791 2 роки тому

    The clearest, and most succinct, explanation of Dijkstra's algo I've seen. Thanks!

  • @MimicalThought
    @MimicalThought 6 років тому +1

    We are learning about Dijkstra's Shortest Path in my Data Communications course and this video explains the algorithm much more clearly than my professor had attempted to explain in our lecture video / notes. Thank you very much, in just 10 minutes I was able to understand something I was spending 30-60 minutes on. Well done!! :)

  • @lewistian7975
    @lewistian7975 5 років тому +13

    BEST explanation of Dijkstra's algorithm EVER!

  • @mikelanigan9601
    @mikelanigan9601 5 років тому +11

    I must commend the quality and clarity of this video: it is by far the best video I've seen on UA-cam to date on the subject of explaining Dijkstra's Algorithm. There are so many other videos that do not deal with the problem of keep a record of the shortest route sufficiently systematically enough, in my opinion. This video is systematic, showing the use of a table to perform the algorithm very clearly. Instruction of this level is not accidental; my congratulations to those involved in its production and execution. You have done the domain of Computer Science the world of good. Keep up the great work!

  • @SpaceDisco1
    @SpaceDisco1 5 років тому +6

    It's really interesting, how sometimes one thorough example can clear up everything.

  • @tundet8963
    @tundet8963 7 років тому +2

    Excellent work, Clarity, and explanation at all stages. Thanks, keep up the good work

  • @Satharus
    @Satharus 5 років тому +4

    Thank you!
    This is the single best video explaining the algorithm on UA-cam.

  • @alpharussel653
    @alpharussel653 2 роки тому +1

    An entire computer science degree courses embedded in this amazing channel. Thank you. Not all heroes wear a cap.

  • @jacklimestone2559
    @jacklimestone2559 5 років тому +2

    Thank you! This really helped me out with my assignment! Nice accent, clear explanation, and visually pleasing.

  • @jackych5055
    @jackych5055 3 роки тому +6

    man this Dijkstra guy deserved a nobel prize for it

  • @nitesh4146
    @nitesh4146 2 роки тому

    This is the best video on Dijstra's Shortest path algorithm I have viewed on UA-cam. Kudos!

  • @5he1tied
    @5he1tied 5 років тому +3

    This is the fourth video I had to watch. Only one that explains clearly, thanks.

  • @ietskaag552
    @ietskaag552 4 роки тому +3

    Seriously, I've been looking at so many pseudocodes and incomprehensible python scripts without any clear explanation on how the algorithm actually works. I salute you. This has helped me so much. I can't thank you enough.

  • @ayasswain
    @ayasswain 6 років тому +1

    Wonderfully explained. The best video i have come across so far on Djikstra's Algorithm.

  • @Museko
    @Museko 7 років тому +40

    I'm watching a bunch of your videos to review for my Algorithms exam. Thanks a bunch for making these!

    • @ComputerScienceLessons
      @ComputerScienceLessons  7 років тому +6

      Thanks for the comment. It's good to hear you're finding them useful. :)

  • @MinecraftLetstime
    @MinecraftLetstime 6 років тому +4

    By far the best video for explaining this algorithm! Perfect.

  • @leox8888
    @leox8888 2 роки тому +4

    Really appreciate this video. As a network engineer, i have read many book about how SPF works but this one is the best. And i can also develop the code based on this video. One thing I was stuck for a while is when having the directed graph (shorted path), it is a bit tricky to print all the shortest path considering ecmp case.

  • @tumarisyalqun7327
    @tumarisyalqun7327 6 років тому

    This is so far the best explanation I have seen, thank you so much!

  • @Monochones87
    @Monochones87 2 роки тому +3

    Lovely, this has been the clearest explanation I've seen so far for Dijkstra's algo. Seriously, thank you so much!

  • @ronglass5968
    @ronglass5968 3 роки тому +8

    The VERY clearest and well-paced explanation by far! Thanks!

  • @Aca99100
    @Aca99100 4 роки тому +2

    I have never seen a video with such clear and step-by-step explanations. Good job here!

  • @tartarus1322
    @tartarus1322 4 роки тому +13

    I wish I could upvote this more than once. It is honestly a brilliant, clear, and concise explanation

    • @ComputerScienceLessons
      @ComputerScienceLessons  4 роки тому +1

      You are very kind. Thanks. :) KD

    • @chinthalaadireddy2165
      @chinthalaadireddy2165 Рік тому

      @@ComputerScienceLessons But really it's awesome video.. the best info in the least possible time.. Thank you so much from India 🥰

  • @andresnieves9018
    @andresnieves9018 6 років тому

    If you can't explain it simply, you don't understand it well enough. Beautifully done. Thank you!

  • @Moggery
    @Moggery 2 роки тому +5

    Fantastically clear and concise. Makes my revision an absolute dream, I can’t thank you enough. 10/10

  • @JamshadAhmad
    @JamshadAhmad 4 роки тому +3

    This video is a definition of precise and concise explanation. Thank you very much.

  • @ulfinawakjira1977
    @ulfinawakjira1977 3 роки тому

    This is by far the best video I've seen on this subject it made implementation very easy and the explanation is the best I've ever seen so thank you very much!

  • @babakbekhradmanesh871
    @babakbekhradmanesh871 2 роки тому +2

    Thanks for your extraordinary explanation. This is literally one of the simplest explanations of an algorithm I have ever watched on UA-cam.

  • @aquilazyy1125
    @aquilazyy1125 3 роки тому +5

    This is very enlightening. I’ve come up with a similar algorithm myself that uses a simple width-first or depth-first search, but I’ve never thought of that we should first calculated the vertex with the least known distance! Thanks for sharing it.

    • @ComputerScienceLessons
      @ComputerScienceLessons  3 роки тому +2

      Don't thank me, thank this guy :)KD
      en.wikipedia.org/wiki/Edsger_W._Dijkstra

  • @abooth1707
    @abooth1707 4 роки тому +1

    Best explanation I've ever seen of this. Thank you so much!

  • @ThewOrldIssqUare
    @ThewOrldIssqUare 3 роки тому +2

    Thanks for this! As others have said, this is one of the clearest explanations on youtube!

  • @dimensionalblade2778
    @dimensionalblade2778 3 роки тому +2

    Damn such a nice tutorial. Also you're making stuffs for VB, you're like the dream channel I've been searching.

  • @supernenechi
    @supernenechi 3 роки тому +3

    You explained this so incredibly clearly! It's really not that hard at all! Thank you so much!

  • @smith1923
    @smith1923 8 місяців тому +1

    This is by far the best video I've seen on this algorithm. It is clear and doesn't skip any steps.

  • @lawrencedennison-hall9642
    @lawrencedennison-hall9642 4 роки тому +8

    Such a clear and coherent explanation. Watched the Craig n Dave video on this previously but this is such a clearer explanation. Understand this now cheers!

    • @ComputerScienceLessons
      @ComputerScienceLessons  4 роки тому +2

      Glad you found it useful. There is nevertheless some good stuff on Craig n Dave's channel :)KD

  • @hgjghjkhify
    @hgjghjkhify 2 роки тому +2

    Appreciate this video. Watched a number of others about Dijkstra's Algorithm and couldn't understand HOW and at what stage another path is evaluated. It wasn't until I saw the graph and how we can track the changes that it somehow brought the entire algorithm into crystal clear focus. Thanks!

  • @amskumar
    @amskumar 5 років тому +3

    Best video on Dijkstra I've seen so far. Thanks for doing it with so much clarity.

  • @selvalooks
    @selvalooks 5 років тому +2

    i used to think this "Dijkstra’s Shortest Path Algorithm" is not for me to understand :) , now i can do it even getting from sleep after watching this video , thanks a ton !!!

  • @sanseverything900
    @sanseverything900 2 роки тому +3

    Thank you for including the psuedo-code at the end. Really helped me get an idea of how I should structure my own code!

  • @ammarulhassan5851
    @ammarulhassan5851 3 роки тому +2

    After spending lots of time on other videos and stuff finally, I have understood "Dijkstra’s" Thanks to this LEGEND.

  • @javadsabbagh8939
    @javadsabbagh8939 6 років тому +4

    Thank you, Kevin. Very understandable and clear.

  • @dawnjinx4962
    @dawnjinx4962 4 роки тому +2

    I FINALLY UNDERSTAND THANK YOU SO MUCH!!!!
    This was the most concise and easy to follow video I've managed to find on this algorithm

    • @ComputerScienceLessons
      @ComputerScienceLessons  4 роки тому +1

      You are most welcome. I usually ask my students to check their understanding by working through it with a different graph. :)KD

  • @michellelopez5264
    @michellelopez5264 6 років тому

    mannnn, i've been trying to find the missing link with this stuff and your video finally shined some light on the subject!

  • @nehascorpion
    @nehascorpion 2 роки тому

    Very well explained! Best video so far on this algorithm. Thanks a ton.

  • @TourGuideFTW
    @TourGuideFTW 7 років тому +5

    The way you explained the algorithm was just great, thanks a lot for making this video!

  • @whiningmachine
    @whiningmachine 2 роки тому

    Fantastic explanation. Indeed, it's the best, clearest, simplest, and most useful resource by far that I've found after hours of searching. Thanks for making it!

  • @DentrifixoRam88
    @DentrifixoRam88 6 років тому

    Hi from Argentina. After watching 4 other videos I can say this is the best explained solution steps I've found so far. Thanks!!

  • @_elguet5787
    @_elguet5787 3 роки тому

    thank you I was really struggling implementing this algorithm in real coordinates, i realized coordinates are like grid/trees if you zoom it, and i could apply your ideas and explanation to find the shortest path available in a set of xyz 'real' coordinates! awesome.

  • @GavinLon
    @GavinLon 5 років тому +4

    This is a great video. You have provided a very simple but clear explanation.

  • @user-lh2cq7yy6b
    @user-lh2cq7yy6b 2 роки тому

    Man this content mind-blowing clear and simple explained, great work

  • @mdotub71
    @mdotub71 7 років тому

    Excellent graphical and verbal explanation, very simple and coherent. Thanks for your video.

  • @nathanriches9547
    @nathanriches9547 2 роки тому

    Thanks James May. This was a great episode of Top Gear

  • @BrendonWilliams
    @BrendonWilliams 7 років тому +4

    Best explanation I could find. Thanks.

  • @RubainG
    @RubainG 7 років тому

    Awesome video ! This made me clear how to simplify and program the Seam algorithm!

  • @ricp
    @ricp Рік тому +1

    This explanation is by far the Best I've seen.. This is crystal clear , thank you very much!

  • @RustysAdventures
    @RustysAdventures Рік тому

    This video is a game changer. Understood it in one shot. Brilliant!

  • @stuffboutthegovermet
    @stuffboutthegovermet 10 місяців тому

    So easy to follow. Best video I’ve seen on this algorithm

  • @ice_cube918
    @ice_cube918 2 роки тому +1

    This is the best explanation of Dijkstra's algorithm I have seen!! I especially like the last summary part.

  • @danielm7755
    @danielm7755 3 роки тому +2

    You've just earned yourself a new subscription champ! Great video! I love it!

  • @alejandrobonilla3201
    @alejandrobonilla3201 5 років тому +1

    You are the best on explaining... Thanks a lot!

  • @GANDHIXtv
    @GANDHIXtv Рік тому

    Best video on Dijkstra's by a considerable margin. Subbed.

  • @sabeen7794
    @sabeen7794 7 років тому

    great video ... you really have the spirit of a teacher ... thanks for making this one.

  • @JaffarBrar
    @JaffarBrar 4 роки тому +7

    Crying in disbelief 😭😭. Finally some clear explanation. Thank youuuuu

  • @kexiuliu6692
    @kexiuliu6692 5 років тому +4

    Really good show of the algorithm. thanks a lot.

  • @young-julee7899
    @young-julee7899 7 років тому +420

    D E A D

  • @chrise202
    @chrise202 4 роки тому +1

    You know this is the best illustration and guideline for implementing it on youtube.

  • @Jack-hd3ov
    @Jack-hd3ov 4 роки тому +1

    After watching about 5 videos on this algorithm, yours has made it crystal clear. Thank you.

    • @ComputerScienceLessons
      @ComputerScienceLessons  4 роки тому +1

      You're very welcome. :)KD

    • @Jack-hd3ov
      @Jack-hd3ov 4 роки тому

      @@ComputerScienceLessons Your A* explanation is also the best I found

  • @forestpfeiffer1370
    @forestpfeiffer1370 4 роки тому +3

    Finally, an example that makes sense, wonderful job!

  • @ahmedsaid8180
    @ahmedsaid8180 2 роки тому +1

    Thank you very much! I have been trying understand this algorithm for 5 hours and I finally got it now "thanks to you"!

  • @q1chen
    @q1chen 3 роки тому

    This 10mins video >>> 45mins video from my lecturer. LEGEND🙏

  • @ddddchannel837
    @ddddchannel837 4 роки тому +1

    Extremely clear and well thought out video. Thanks for uploading!

  • @ayasswain
    @ayasswain 7 років тому

    The best video on shortest path algorithm on UA-cam. Some of other videos that comes at the top of the search result are crap. People have unnecessarily complicated the explanation.

  • @drowmik
    @drowmik 4 роки тому +2

    I'm a programming lover man who have no computer science degree. I have seen many videos but this is the best and easiest way to explain the algo... Thanks a lot.. want more

  • @Satharus
    @Satharus 5 років тому +2

    This is the single best and most simple explanation of Dijkstra's algorithm. It saved me multiple times.
    Thank you so much.

  • @miller5565
    @miller5565 3 роки тому +2

    I couldn’t have asked for a clearer video, thank you sir.

  • @leonidsukharnikov2563
    @leonidsukharnikov2563 4 роки тому

    Perfect video! Clear examples, understandable English and ... no profanity.

  • @Funnybone_FB
    @Funnybone_FB 2 роки тому +1

    Brilliant. Very well-done and clear explanation. Thank you for this!

  • @nicolasgorse488
    @nicolasgorse488 7 років тому +1

    Kevin, this is a great and super clear explanation, really !

  • @KamalMettananda
    @KamalMettananda 3 роки тому +1

    This explains it perfectly. Thank you so much.

  • @hiroKoichi
    @hiroKoichi 5 років тому +1

    Very clear example and nice explanations!

  • @binoyskumar
    @binoyskumar 6 років тому +1

    Perfect!
    keep it coming. Well explained

  • @shayanmj2006
    @shayanmj2006 5 років тому +3

    Amazing, thanks for making a clear explained video

  • @anthonyellis9122
    @anthonyellis9122 7 років тому

    REALLY well explained. Nice and slow, nice and clear! Many thanks!

  • @hanbrianlee
    @hanbrianlee 5 років тому +5

    Omg.. out of like 10 dijkstra vids i attempted to eatch this is the best