The general process of the SPFA algorithm is to use a queue for maintenance. Initially, the source point is added to the queue, one element at a time is taken from the queue, and all the points adjacent to it are relaxed. If a neighboring point is relaxed, it is added to the queue. The algorithm ends when the queue is empty