Dijkstras Algorithm Directed Graph Example

Dijkstra's Algorithm demo example on a directed graph, single-source shortest-paths algorithm finds the shortest path from a single source vertex to every other vertex in the graph.

ALGORITHMS

[biketrail]

this example was exactly what I needed to help me understand a homework problem

[realurah]

u r better than my teachers man. thanks a lot

[korneliuspasztor]

Second video of urs I watch this evening, short fast and easy to understand ^^

[cptalpdeniz]

I don't understand why you jumped to H?

[huutronghuynh]

Thanks for the video, I have a question, what happens if we change the distance from S (source) to A as 20, and to D as 2. If so, the algorithm will visit D instead of A (because it has shortest path), but D has no adjacent node, so the algorithm stops there ?

[fabihatabassum]

thanks a lot, for understanding such a nice way :)

[Dsart]

Will the implementation of this algorithm?