Dijkstra算法的思想是，首先将图D中所有的顶点V分成顶点集合S和

The idea of ​​Dijkstra's algorithm is to first divide all vertices V in graph D into a vertex set S and a vertex set T. In set S, the end point of the shortest path has been determined by taking v as the source point. Initially, set S only contains vertex v, while set T is the vertex of the shortest path to source point v. Then select the point with the shortest path in the S set from the T set each time, and add it to the set S, and delete this point from the set T. Until the T set is empty.

The idea of the Dijkstra algorithm is to first divide all vertex V in Figure D into vertex collection S and vertex set T. The end point of the shortest path has been determined with v as the source point in collection S, the initial time of collection S contains only vertex v, and the vertice in collection T is the vertice that has not yet determined the shortest path to the source point v. Then each time from the T collection to the S collection to the shortest path of the point, and add to the collection S, and this point from the collection T removed. Until the T collection is empty.

The idea of Dijkstra algorithm is to divide all vertex v in graph d into vertex set s and vertex set t. In set s, the destination of the shortest path has been determined with V as the source point. At the beginning of set s, only the vertex v is included. In set t, the vertex of the shortest path has not been determined to the source point v. Then select the shortest path point in s set from t set every time, add it to s set, and delete this point from t set. Until the t set is empty.<br>