User:Myeongji

Dijkstra algorithm : find min. length from start to end.

Before start : no nodes are "visited" and assume that length from start node to any nodes are infinite because you cannot know the length. and set start node to "current" node.

Step 1 : Find all adjacent nodes from the "current" and find length from start node

Step 2 : set "current" node to "visited" node, and set the node of min. length among all nodes except "visited" to "current" node.

Step 3 : Repeat Step 1 and Step 2 until all nodes are "visited" or end node is "visited"

That's all, and Free Hong Kong.