本课题首先釆用图的邻接矩阵或邻接表实现单源最短路径问题中图的存储，其次

This topic first uses the adjacency matrix or adjacency table of the graph to realize the storage of the graph in the single-source shortest path problem, and secondly uses the Dijkstra algorithm, Bellman–Ford algorithm and its improved algorithm, namely the SPFA algorithm, to seek from a certain source point to the rest The shortest path of each vertex. Then use Matlab as the development platform to code the single-source shortest path mining algorithm to complete the simulation and implementation of the algorithm. Finally, through the test and comparison of these three algorithms, the following conclusions are drawn: <br>(1) Dijkstra: single-source shortest path suitable for graphs with non-negative weights <br>(2) Bellman-Ford: single-source shortest path for graphs with negative weights, and can detect negative cycles. <br>(3) SPFA: Applies to the shortest path of a single source for graphs with negative weights and no negative cycles.

This topic first uses the adjacent matrix or adjacent table of the graph to realize the storage of the single-source shortest path problem, and secondly uses The Dijkstra algorithm, the Bellman-Ford algorithm and its improved algorithm, that is, the SPFA algorithm, to find the shortest path from a source point to the rest of the vertices. Then, Matlab as the development platform for the single-source shortest path mining algorithm for the code, complete the simulation and implementation of the algorithm. Finally, the following conclusions are drawn through the testing and comparison of these three algorithms:<br>(1) Dijkstra: The shortest single-source path for graphs with a weight value of non-negative.<br>(2) Bellman-Ford: the shortest single-source path for a graph with negative weight, and the ability to detect negative rings.<br>(3) SPFA: The shortest single-source path for graphs with negative weights and no negative rings.

Firstly, the adjacency matrix or adjacency table 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 code the algorithm of single source shortest path mining, and the simulation and implementation of the algorithm are completed. Finally, through the test and comparison of these three algorithms, the following conclusions are drawn:<br>(1) Dijkstra: single source shortest path for graphs with nonnegative weight values.<br>(2) Bellman Ford: it is applicable to the single source shortest path of graphs with negative weights, and can detect negative cycles.<br>(3) SPFA: it is applicable to the single source shortest path of graphs with negative weights and no negative cycles.