Dijkstra 算法

all the nodes should be carectorized into three groups: (visited, front, unknown) we should pay special attention to front group. The Dijkstra Algorithm: front = start node while front is not empty: 　

>>阅读原文<<