Calculate shortest paths in Java by implementing Dijkstra’s Algorithm
Sylvain Saurel

Great way to explain and easily understandable code. Thanks a bunch Sylvian!!
I have a question though: If i want the source node to be dynamic or user defined instead of node “0”, what piece of code should I change? 
For example instead of finding the shortest distance from node 0 to node 4 , what I have to change to find the shortest distance from the node 1 to node 4 or node 6 and so on ?

One clap, two clap, three clap, forty?

By clapping more or less, you can signal to us which stories really stand out.