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

4 жыл бұрын

Great to hear! :)KD

@vijayalakshmi0714

2 жыл бұрын

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

@eatbreathedatascience9593

2 жыл бұрын

I agree fully. Best !

@tudorradu5848

Жыл бұрын

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

@555aboud

5 ай бұрын

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

FINALLY SOME CLEAR STUFF. almost crying

@OscarSotomayor

7 жыл бұрын

jaja...you made my day

@MinecraftLetstime

6 жыл бұрын

Me too!!

@SkyWalker9669

4 жыл бұрын

said what i wanna say

@exactzero

4 жыл бұрын

HAHAHAHAHA

@veggieblues

3 жыл бұрын

mood

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

@ComputerScienceLessons

4 жыл бұрын

A was no fun. :) KD

@ashutoshthite

3 жыл бұрын

🦍🦍😂😂

@trulyharsh

3 жыл бұрын

Wiz Khalifa's "See You Again" Plays in The Background

@user-wq2iv3cq2h

3 жыл бұрын

i laughed hard reading this

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

@neelparekh9846

4 жыл бұрын

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

@neptechbyte

3 жыл бұрын

haha epic comment bro

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

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

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.

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

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

@ComputerScienceLessons

Жыл бұрын

You're welcome :)KD

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

@ComputerScienceLessons

7 жыл бұрын

I really appreciate your comment. Thanks.

@trellas3689

8 ай бұрын

extremely

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

I signed in just to like this video.

@magicianwizard4294

4 жыл бұрын

and to comment apparently

@hariprasathgcse3381

Жыл бұрын

U r loyal

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

BEST explanation of Dijkstra's algorithm EVER!

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

I must commend the quality and clarity of this video: it is by far the best video I've seen on KZread 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!

@ComputerScienceLessons

5 жыл бұрын

Thanks for the great comment Mike.

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

@ComputerScienceLessons

8 ай бұрын

You are most welcome :)KD

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

Thank you! This is the single best video explaining the algorithm on KZread.

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

@ComputerScienceLessons

7 жыл бұрын

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

man this Dijkstra guy deserved a nobel prize for it

@ComputerScienceLessons

3 жыл бұрын

He was a clever chap! :)KD

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

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

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

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

@ComputerScienceLessons

3 жыл бұрын

You are too kind :)KD

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

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

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

@ComputerScienceLessons

4 жыл бұрын

You are very kind. Thanks. :) KD

@chinthalaadireddy2165

Жыл бұрын

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

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

@ComputerScienceLessons

2 жыл бұрын

Thank you. Delighted to help :)KD

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

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

@ComputerScienceLessons

2 жыл бұрын

Thanks for saying so. You're most welcome :)KD

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

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

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.

@ComputerScienceLessons

4 жыл бұрын

Yo are most welcome :)KD

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

@ComputerScienceLessons

4 жыл бұрын

I appreciate the comment. Thanks. :) KD

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

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

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

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

3 жыл бұрын

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

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

@ComputerScienceLessons

2 жыл бұрын

Thank you. You are very welcome:)KD

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.

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

4 жыл бұрын

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

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

Thank you, Kevin. Very understandable and clear.

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

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

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

@ComputerScienceLessons

7 жыл бұрын

Tnx for the feedback :)

@swethapuskoor7314

4 жыл бұрын

Computer Science can you explain bellman ford too

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

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

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

@ComputerScienceLessons

6 ай бұрын

Thank you :)KD

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

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

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

@ComputerScienceLessons

3 жыл бұрын

You are most welcome :)KD

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

@ComputerScienceLessons

2 жыл бұрын

Glad to help :)KD

Best explanation I could find. Thanks.

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!

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!

@ComputerScienceLessons

Жыл бұрын

You are most welcome :)KD

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

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

Finally, an example that makes sense, wonderful job!

@ComputerScienceLessons

3 жыл бұрын

Glad to help :)KD

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

@ComputerScienceLessons

4 жыл бұрын

You are very welcome. Glad to help. :) KD

D E A D

@ComputerScienceLessons

7 жыл бұрын

Accidental!

@yunyizhu8358

5 жыл бұрын

kinda scary when it turns red lol

@MarkTheMadMan

5 жыл бұрын

haha i saw this instantly, maybe its a sign :/

@celsiusfahrenheit1176

3 жыл бұрын

(ʘᗩʘ')

@iansugg3496

3 жыл бұрын

Me after my Data Structures and Algorithms final exam

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

4 жыл бұрын

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

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

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

@ComputerScienceLessons

Жыл бұрын

Thank you :)KD

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

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

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

@ComputerScienceLessons

6 жыл бұрын

Tnx

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

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

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

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.

two hours of a boring lecture vs 10mins cool explanation. thanks mate

@ComputerScienceLessons

4 жыл бұрын

You're very welcome :)KD

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

@ComputerScienceLessons

4 жыл бұрын

You're very welcome. :)KD

@Jack-hd3ov

4 жыл бұрын

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

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

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

@ComputerScienceLessons

Жыл бұрын

You are very welcome, and thank you :)KD

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

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!

@ComputerScienceLessons

2 жыл бұрын

Thank you - and you are most welcome :)KD

This video is your shortest path to learn Dijkstra Algorithm.

@ComputerScienceLessons

2 жыл бұрын

🤡 :)KD

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

@ComputerScienceLessons

4 жыл бұрын

Thanks :) KD

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

@ComputerScienceLessons

3 жыл бұрын

Thank you and you are most welcome :)

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

Really good show of the algorithm. thanks a lot.

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

Very clear explanation. Well done!

@ComputerScienceLessons

7 жыл бұрын

Tnx Chris

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

@ComputerScienceLessons

4 жыл бұрын

You are very welcome. Thanks for the comment. :)KD

This is just phenomenal

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

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

@ComputerScienceLessons

2 жыл бұрын

Thank you. Glad to help :)KD

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

@ComputerScienceLessons

4 жыл бұрын

Glad you liked it. Thanks for the comment. :) KD

Most efficient video on dijkstra's algorithm out there :)

Congrats! Very well explained!

Perfect! keep it coming. Well explained

Very clear example and nice explanations!

Thank you for this brilliant explanation!

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

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

@ComputerScienceLessons

2 жыл бұрын

You're most welcome :)KD

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

@ComputerScienceLessons

3 жыл бұрын

You're most welcome :)KD

This explains it perfectly. Thank you so much.

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

@ComputerScienceLessons

2 жыл бұрын

Thank you. You are most welcome :)KD