最短路径算法是计算机科学研究的一个热门话题，既具有重要的理论意义，同时

The shortest path algorithm is a hot topic in computer science research, which has important theoretical significance and practical value at the same time. The shortest path problem has been applied in many fields, such as in the research fields of transportation system, emergency rescue system, electronic navigation system and so on. This topic is mainly directed to the single-source shortest path problem: given a weighted directed graph D = (V, E), where the weight of each edge is a real number. In addition, given a vertex in V, called the source. To calculate the shortest path length from the source to all other vertices. The length here refers to the sum of the weights on all sides of the road. In this topic, firstly, we use the adjacency matrix of the graph to realize the storage of the graph in the single-source shortest path problem. Secondly, we use the Dijkstra algorithm, Bellman-Ford algorithm and its improved algorithm, namely the SPFA algorithm, to find the solution from a certain source point to the remaining vertices Shortest path. Then use Matlab as the development platform to simulate and implement the single-source shortest path mining algorithm. Finally, through the test and comparison of these three algorithms, the following conclusions are drawn:

The shortest path algorithm is a hot topic in computer science research, which has important theoretical significance but also important practical value. The shortest path problem has been applied to many fields, such as transportation system, emergency rescue system, electronic navigation system and other fields. This topic is mainly aimed at the single-source shortest path problem: given a band-in-a-right directional graph D (V, E), where each edge of the right is a real number. In addition, a vertex in V is given, called a source. The shortest path length to calculate for all vertices from the source to the other. The length here refers to the sum of the rights on each side of the road. This topic first uses the adjacent matrix of the graph to realize the storage of the single-source shortest path problem, and secondly uses Dijkstra algorithm, Bellman-Ford algorithm and its improved algorithm, that is, SPFA algorithm, to find the shortest path from one source point to the rest of the vertices. Then, Matlab as the development platform for the single-source shortest path mining algorithm for simulation and implementation. Finally, the following conclusions are drawn through the testing and comparison of these three algorithms:

Shortest path algorithm is a hot topic in computer science. It has important theoretical significance and practical value. The shortest path problem has been applied in many fields, such as transportation system, emergency rescue system, electronic navigation system and so on. This paper mainly aims at the problem of single source shortest path: given a weighted digraph d = (V, e), where the weight of each edge is a real number. In addition, a vertex in V is also determined, which is called the source. To calculate the shortest path length from the source to all other vertices. The length here is the sum of the weights of all sides of the road. Firstly, the adjacency matrix of graph is used to store the graph in the shortest path problem of single source. Secondly, Dijkstra algorithm, Bellman Ford algorithm and its improved algorithm, SPFA algorithm, are used to find the shortest path from a certain source point to other vertices. Then, Matlab is used as the development platform to simulate and implement the single source shortest path mining algorithm. Finally, through the test and comparison of these three algorithms, the following conclusions are drawn:<br>