Dijkstra算法论文有哪些

Dijkstra算法论文包括：
1. Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269-271.
2. Dijkstra, E. W. (1961). A note on two problems in connexion with graphs. In Numerische Mathematik (Vol. 3, No. 1, pp. 269-271). Springer Berlin Heidelberg.
3. Dijkstra, E. W. (1968). The shortest path problem. In Proceedings of the international symposium on theory of machines and computations (pp. 195-207).
4. Dijkstra, E. W. (1971). A formal treatment of the problem of finding shortest paths in a network. Mathematical Centre Tracts, 53, 1-22.