Dijkstra's Algorithm: Shortest Path

[BangaloreGuy2010]

There might be some errors but the video is very clear and helps explain the concept very well. Thanks

[smlzgr12]

yes it is very very helpful but it doesn`t mean they are wrong. that error may confuse someone

[helibbc]

Despite the fact that everybody wants to prove that they are so smart, the video is REALLY helpful. I have a final exam tomorrow and the text book didnt explain this well. YOU SAVED MY ASS

[0rdon]

Thanks for the upload it's very usefull and clear!

[PlunderGames]

Very helpful. I "thought" I understood the algorithm, but when the time came to implement this in a project, I found I did not. This helped the logic of my code flow much better. Thank you!

[008him]

Actually this algorithm works a bit differently. After we are done with A, we should have jumped to B rather than to C in 2nd step and then seen the shortest path. The reason is that in this algo, we are supposed to jump in an order of shortest path from a given node. So after 1st iteration, shortest from A is B and not C. The reason behind this is that there may be a shorter path to C via B, which you can see in this video is there. Still Thank you Profbbrown. This video was of great help.

[profbbrown]

You're all right about the errors in this video. I'll have to post a corrected one!

[hle610]

Why C not be B6, short than A9?

[zxcvbnm2641294]

is there any tutorial for bellman ford algorithm in the same manner it was very good

[nikhiljain103]

where is the fucking modification lowest cost of all vertices ??

[Potar4y]

anyway.. leaving the small mistake out.. its been a helpful video explaining the Dijkstra's algorithm, thanks

[koensieben622]

Despite the mistake, this explanation is very very clear! Thank you! So people, always choose the neighbour with the lowest cost to continue!

[TheHganavak]

The comments regarding the fact that you chose the wrong route to C are correct. Regardless, this is still the best explanation of Dijkstra's algorithm I've seen on the internet.

[ballark]

I love your vibrant voice. You must be a sexy professor.

[Matizor]

thanks, very useful :)

[masterchief9064]

You have done this incorrectly. From A you should have gone to B first. The algorithm states that you use the smallest path from the 'current node'. From B to C is 6 as opposed to A to C which was 9.

[dark4o90]

really good explanation it will help me for my algorithms exam

[maheekz]

Dijkstra should produce the shortest path to all vertices from A in this case. So how come C is having A9 when it can have a shorter path with B6 ? I think it is not correct to go to C after doing A. You need to do B since it has the minimum weight from A. Is this correct?

[dbraun86]

@maheekz I was going to post the same thing - you're correct. The algorithm clearly states that the next "current node" should be the one with the smallest distance from the current one.

Source: wikipedia

[EGYgood]

@maheekz

you are right

[kapilbhandari3012]

@maheekz : yes u are right, cost from a to b is 2, cost from a to g is 4 and cost from a to c is 9.

so the vertex b is to be chosen, and not c nor g.

[gv2416]

@maheekz

It might have been because they were looking for the shortest path (not necessarily the lowest cost) and from A you only need to go through one point while from B you would have to go through two.

At least I think that's what he was going for. :P

[scawfield07]

@maheekz i got your point. i was also confused the first time. i think you are right

[ShallowHeartNB]

it is correct, you start with a node and see what directions you can go and take the smallest one and keep looking for better paths - watch?v=8Ls1RqHCOPw

[djay08091986]

a very good explanation! thank you

[fabiusIII]

love it!

[caplunga]

very nicely explained

[willclegg1]

Cheers that was a fantastic explanation :). That has really helped me to understand it better