Design and Realization of Dijkstra Algorithm Program Based on the Optimaion of the Shortest Path Problem

In the 1990s,the best algorithm for the shortest path problem is the labeling algorithm proposed by E.W.Dijkstra in 1959,which can solve the shortest path problem efficiently.But the realization of the algorithm is manual,and require a large quantity of calculation,which is very complex.In this paper,the algorithm based on the matrix and is realized by program completely.This solved the difficulties above greatly and made two more complicated problems: the shortest path problem and the shortest distance problem very easy.