Graphs: Dijkstra's Algorithm

[MohtadiElhajj]

very nice .. i like

[lilnaable]

A very good videos, I understand really now.

Thank you

[zlotedziecie]

really helpful. thanks!

[subverto]

while studying i accidentally discovered that playing this video and the following chillout track sounds really good!

watch?v=o4LsDPdD4T4

[xcho20]

thanks!

[juvanjan]

love ur voice!

[rickycax]

thanks a lot, Is this "Dijkstra’s shortest path algorithm" ? or only Dijkstra's Algorithm? are they the same or different things?

[cSharpIndonesia]

183,000 CS dorks

[Drobikus]

You sir, are a gentleman and scholar... Thank you very much!

[LSAeindhoven]

very well explained! :-)

[nafnaf6002]

OMG that was amazing i was desperate to understand this thing cause there are only 4 hours till my final and then i found this tutorial when i was revising

thnq so much you saved me <3<3<3

[alexstapf]

Now I finally understood it... Thank you!

[1komanche1]

nice !

[TheZelovocaR]

Greetings from STUBA FEI :D

[MasterGamingLion]

Dude. Thank you so much. This helps me a LOT, I have a final tomorrow!

[Mo00odyKsa]

thanx so much i have a final exam tomorrow :(( you help me thanx ^^

[bytheocharis]

good job bodies!

[saurabh1qaz2wsx3edc]

thnk u so mch... have xams in 8 hours :P

.

thnx 2 u... will at least score 5 marks for Dijkstra algo :D

[sherifportrait]

@saurabh1qaz2wsx3edc lol,

[Mr999danger]

Thanks, great explanation.

[fatalerror177]

thank you :)

[rahulm92]

thank you!

[5nawneet5]

thanks a lot, i have exam in next 1 hour nd it helped me very much........:)

[anasfcb]

Thanks a Lot !! I have Exam tomorrow too !! This algorithm has been a headache to me for a long time untill I saw and understood your very good leçon a few seconds ago ! Thanks again Sir !

[JaroneMcCorkle]

I second that life saving.

[UnrealLotus]

I have an exam tomorrow and you have just saved my life! Thanks!

[parikshitcs]

good...



[raviharshil27]

too gud thnx a lot!..it really helped me a lot!..

[ffletcherr]

Wow thank you! I was struggling to understand how I might write this in java code, but this video explained It in such a way that I can now easily figure it out. This is the best explanation I've seen of Dijkstras algorithm.

[Dheedhify]

more vids plz ... you explain very well

[redhaitianz]

LOOK AT GOD!!!

[bigskipy]

U suck !

[sskcn]

such a good explanation. THANK YOU!

[vimarshk]

Awesome

[darkcarney1]

Awesome, Exam later today and was totally blanking on Dijkstra algorithm

Thanks heaps

[Lagonz2000]

Thank you! Thank you! Thank you!

[IsNgRt]

YOU ARE MY HERO! YOU SAVED MY ASS !

[orb90210]

good job

[CGagnon5]

I really like this notation. Thank you!

[Ilikemustard]

Why do you have ratings disabled? It makes me think the video will be bad.

[dagn28901]

thanks

[elvircrn]

Awesome, thnaks man.

[MultigrainPie]

whenever you use the yellow highlighter i keep thinking it's gonna smudge the black ink lol

[Nancybabe94]

Thank you so much. It completely helped me understand this.

[gangsterpj]

awesome explanation..very clear..hoping for more uploads.. :)

[MommehTommeh]

Thank you very much!

[rebcabin]

Very nice! -- quick question: how did you create the video? Love the hand-written style! Looks like NoteShelf on the iPad.

[masterchief9064]

well explained. thanks!

[MsKoala104]

very helpful video..I learned a lot! tnks

[MrSyKoM]

Thanks, this helped me. I have to specify that this is no the Djikstra original algorithm: this is implemented choosing the min vertex (with a min heap), the original algorithm choses the first node of a queue. Anyway, it does not change the core buisness :) Thanks!

[HierisBestand]

alright :) good stuff, build my c++ dijkstra algorithm on this :)

[gauravsahani07]

this is very helpful...do refer it..

[AbdullahBogamy]

thanks 

[anasazeemyt]

Thanks Friend but what would be the final answer to it,

would there be some sequnce of verices as answer.

Somebody plz answer i m havin my exam tomorrow..

thanks

[andend6666]

daj lajk ak si tu z FI MU :D

[richardhierweg]

@andend6666 thumb-whore :P

[fr6nco]

@andend6666

FIIT STU :D

[ssjg0ten]

is this the same as shortest path length?

[CraigHerndon2009]

@ssjg0ten

This will give you the shortest path. To get the length of that path, sum the edges used in it.

[stevoo911]

COMPUTER SCIENCE UCD !!!

[KuramaYoko10]

Very good explanation. Thank you!

[baconhunter4567]

Very helpful video.

[runzombies]

Awesome. This was extremely helpful. Thank you!

[starefossen]

Thanks a lot. I'm practicing to my exam in Computer Networking where routing algorithms are very essential (at least for the part about DNS). This video helped explaining a lot. Thanks!

[plugantz]

^________^



[ddgens]

awesome

[ddgens]

awsome

[manojsam79]

Is there a way to easily identify all the shortest paths from A once you are given only the completed table? Like A -> B -> F -> C -> D -> whats next H or G, how to decide without the graph?

[viharsarok]

@manojsam79 You only need the last row. Begin at the vertex you're interested in, look up its parent (the node that's written under the optimal cost), than look up the parent's parent etc. Proceed until you reach the starting node. Reverse the list of nodes to get the shortest path.

E. g. the shortest path to H is

H, C, F, B, A

reversed, that is

A, B, F, C, H

[CleanRapMusic]

@viharsarok Thanks dude, I was a little confused.

[3dator]

Thank you very much! That helped me a lot!!

[U0ykcuf]

Thank you so much. My textbook is super vague on this, and now I finally understand.

[chriskenward]

lil help..?

[ghowe1979]

*NOW* I understand!

[thatAdamskid]

@allensugar ! doesn't mean factorial and your mother was a hamster

[miljkod]

thanks

[thatAdamskid]

Just wanted to thank you profusely. And also to say this is my first actual youtube comment. Hello world!

[allensugar]

@thatAdamskid debug error: hello world factorial undefined

[tuntuni1000]

What's the software you're using? Btw, nice tutorial!

[avinashmeda]

thanks for a brilliant video.

[madhatter133]

thank you sir

[qwertz4you]

i fucking like!?!?!? FINALLY someone who Explains!

[criticalkasuba]

isn't this greedy algorithm used for this particullary problem with graphs?

[moooozy]

Thanks very much i have Exam tomorrow and it's helped alot (^_^)

[2808879]

@moooozy ip!

[harryhaeck]

thanks, very clear explanation

[bharatraturi]

thanks.

[bharatraturi]

fantastic one. i had been trying to understand this for a long time but this video really took very few of my time to make me understand

[Gretgor666]

Any idea where I can find the correctness proof? I was always curious about it, but never found it.

[ytName2009]

This is the simplest use of Dijkstra algorithm and the best explanation I have ever seen!!! Thank you so much for making this video!

[lisagibbon]

thank you sir.

[xxyuri]

thank you very good tutorial , clear explanation !!!

[silversvartnad]

Thi vid makes it very easy to understand the algorithm.

Thanks a lot =)

[hsnan009]

thanks it helped alot

[AndykeMusic]

Great video, thank you!

[Lonarl]

You just saved me for my final exam! This is the only problem I had trouble with. Thank you!

[koundi1234]

Great Video.... Awesome

[crazyminti]

Sorry, one question: How do you know that the trips are the shortest path already? When you highlight B , in the first iteration, why dont you assume that D and G have been found aswell already?

[PatRevenant]

@crazyminti I know this is quite late but I can answer. You automagically know that the smallest of all the paths you have found are the shortest path, simply because its the smallest of all the paths (useless sentence, i know). I assume you were thinking that maybe there was another path that took 2 iterations to get there that could possibly be faster. This is impossible, because the only other vertices you can get to are already a longer path.

[adikelkar4]

awesome video!!! quick learning!!!

[arnab18]

Excellent video...thank you very much

[arnab18]

Excellent video...thank you very much

[markaawi54]

Excellent!!! you made it really easy to grasp in 10 minutes than a full class lecture. Thank you very much, keep up the good work.

[lanoche]

helped a lot, managed to learn more in 10 minutes with your explanation, than with my prof's lecture that took 3 hours

[anjanavdas]

Thank you very much for this video

[Tgasparian]

This is much better than my text book explanation

[ahmed172006]

Thank You

Really Great Video

[szamoransky]

who is this? Paul Stupin?

[sutanug]

thank you

[lizard2728]

Thank you -- awesome explanation! I'm needing to implement the algorithm, and this helps tremendously!

[Sparuuto]

Thanks for explaining this so clearly.

[Johannady]

I'm confused about H and G..

[VanAshkevron]

Thank you, I just had to implement Dijkstra's algorithm and I'd have been lost without a good explanation.

[rinolex]

You are doing it wrong pederas!

[sarathmsm1]

GREAT!!!! THANK U VERY MUCH....

[TheAvinashviru]

great work!!!

really easy to understand...

[judearasu]

Hi thanks for this videp.I am student from BITS.This one is too good

[TheSciencesite]

Perfect! Thanks!

[anzin74]

Oh man... So it's kind of like Prim's Algorithm, but not?

[ghostmonkeys]

This algorithm is so annoying, thank you for making it more clear than the textbook.

[berardi1111]

Thank you this is so much more clear than my text book

[asda110knm]

Thank you. It was easier than I thought!!! :) And you explained everything perfect, indeed :)

[TCM88]

great! thx man! this helped me alot ^^

[RaggedRooster]

This doesn't work.

[imorio]

@RaggedRooster This is mathematics, you're going to have to prove your assertion.

[elgonost]

In case there are 2 paths with the same minimum cost which node will we choose as next? For example. Lets say there is a path from A to E that costs 20. We have A->B costing 20 and A->E costing 20. Which one will we choose??

[imorio]

@elgonost You could choose a random path, or the path given by the algoritm checking for the lowest number. I suspect you could enhance the algoritm to track both paths in that case. Now it only finds the shortest path to a point, if you rewrite the algoritm to track both and continue further steps seperatly, you'd get an algoritm that gives all shortest paths to all points.

[waslap]

GREAT video! Thanks so much, super easy to follow every step

[safyanshah]

Great Video. Easy to understand. Thanks for sharing.

[alicektn]

it was presented in an easy way to understand. thank you very very much!

[BetrayB3]

Great Video!

[BlastedNation]

If u want to know what's the shortest path between A and F, for example A,B,C,D,E,F... how do you get that info from there?

[TheAustiniho]

@BlastedNation shortest path to F is 30 and via B. As shown in the chart. You can't go a,b,c,d,e,f on this, as there are one way routes, and no way to get to E. If you want to know that on a different kind of map, just add up the values?

[pinQ121293]

what a great video!! i could understand noww!! thx a million to whoever make the video!!!

[slyzermendes]

where is the path? no path... you got there? and what?

[joehovado]

yeah it was very helpfull for my exam. I was not able to undestand it without and example and practise. .)

[nerzuhl182]

Awesome vid might pass my Data Structures and Algorithms exam now!

[Andrd110]

Excellent, clear n concise

[nawkwan]

Thanks for this clear illustration and explanation. Good Job.

[EINMYRIA1]

Einmyria loves you :D

[PaTTaMoNE]

Can I ask a question?

What is the meaning of RELAX?

And Thank you very much for your video.

It helps me a a lot.

You are really a good teacher :)

[Homer149]

thank you, i have a test about it tomorrow :)

[hasanda5555]

thank you

[nihalgesudraz]

So we start from any arbitrary point. But what happens if we start from E? That way, we'd end up covering E too, isn't it?

[QauNuckShin]

@nihalgesudraz Yes, but then we'd know the shortest path to each vertex from E, instead of from A as we calculated in the video. So, it depends on which information you actually want. ;)

[juggleninjaguy]

excellent! very patient and very clear.

[TheAndrey]

very helpful! Thank you

[Masenken]

wow, now if math teachers could find ways to be this straightforward and concise in their teaching, we'd all be astrophysicists by now. Nice explanation

[yendor112]

thanks

[imjustbored24]

thank you!!! it's so clear and concise

[zelinkgan]

this is the best explanation of Dijktra that i ever seen in the internet, thanks a lot :)

[DavidMTRutten]

Well done, excellent description. But why no rating?

[TheSongton]

Awesome

[LarryKingLui]

absolutely perfect! Thank you so much...

[gurindermonu]

awesome..........

[Nictron80]

Thanks a lot, this will help me with my test next Tuesday. :)

[SteelXManGER]

Nice video, thank you very much !

[azoth23]

awesome

[kabushalha]

Thank you so much friend,it is really a great job.

I really appreciate people who like to share their knowledge

[mikydutzaa]

ur graph example did everything.:) all exceptions were in that graph thx for sharing

[AndiTheBest]

nice! now i understand for my exam, thanks :)

[johndoe1893]

great to learn what makes OSPF possible

[ocb2112]

wow i have been searchin through my skripts and through wiki to learn that stuff. but that was the best explanation by far! good job and thank you!

[mightyrsm]

Thanks, u spoke and wrote with great clarity.. done me a favor today :)

[Ben1220]

So well explained that my Grandma understood it!

[dikpersoon]

Thank you, you are amazing! =D

[Buuuuurpz]

Awesome job! I appreciate it!

[jiransilhan]

thank you very much!!!!!

[symb09]

Very good job, good explanation, and good use of pictures to help illustrate!!!

[wendyhiggs]

thanks!!!!!

uesful!

[EvM18]

I've got a test about this tomorrow, now I completely get it, thanks!

[sonex07]

I love you right now ha ha

[Rahim4815162342]

Thank u VERY much!

[sahaskatta]

that was quite helpful for my C++ class, thanks!

[and2dude]

thank you so much