Dijkstra algorithm under the priority queue (struct-to-queue conflict)

The value of the data added to the queue will not change, so it is not feasible to use the value of the struct to add the struct to the queue and update it.

(This also results in the use of the optimized version of the Dijkstra algorithm when you cannot use the structure that contains the ordinal of each point and the shortest distance from the initial point, as this will result in the inability to update the distance within the structure in the queue.

And can only add the ordinal to the queue, because the distance is need to update, and added to the STL internal values can not be updated, and then need a trick to have only the sequence number of the queue can still correctly eject the required sequence number, the operation is as follows)

Dijkstra algorithm under the priority queue (struct-to-queue conflict)