摘要：
先看看wiki的算法描述:Let the node at which we are starting be called the initial node. Let the distance of node Y be the distance from the initial node to Y. Dijkstra's algorithm will assign some initial distance values and will try to improve them step by step.Assign to every node a tentative distance 阅读全文
