The shortest path is the optimal solution to get the distance from a node to all other nodes. Traditional Dijkstra algorithm is the most classical algorithm to find the shortest path and is the basis of optimizing algorithm. The paper introduces the corresponding concepts of the traditional Dijkstra algorithm and its working principle. Then the algorithm is realized by Java, the pseudo key codes and operational results are given at last.%最短路径是一个顶点到其他所有顶点的距离的最优解。传统Dijkstra算法是求最短路径最经典的算法，是后续最短路径算法改进的基础。本文介绍了传统Dijkstra算法的相关概念及其实现原理，使用Java编程语言实现算法，最后给出关键伪码和运行结果。
展开▼
