spfa（SPFA）.docVIP

spfa（SPFA） SPFA for single source shortest path SPFA algorithm, the full name is: Shortest, Path, Faster, Algorithm. The SPFA algorithm was published by Southwest Jiao Tong University van Ding Yu in 1994 From the name we can see that this algorithm excels in efficiency. A lot of times, when a given graph has a negative weight, then the algorithm like Dijkstra doesnt work, and the complexity of the Bellman-Ford algorithm is too high, and the SPFA algorithm comes into use. For brevity, we agree that the weighted graph G does not have a negative weight loop, i.e., the shortest path must exist. Of course, we can do a topological sorting before executing the algorithm to determine if there is a negative loop, but thats not the point were talking about. We use the array d to record the shortest path estimate for each node, and store the graph G with the adjacency table. Our approach is dynamic approximation method: set a FIFO queue to store the node to be optimized, out of the first team to optimize each node u, and u with the shortest path of the current estimated value refers to the departure point u node V relaxation operation, if the shortest path point v the estimated value was adjusted, and the V is not in the current cohort, will V into the tail. In this way, the node is removed from the queue to relax until the queue is empty. Theorem: as long as the shortest path exists, the above SPFA algorithm must be able to find the minimum. Proof: every time a point is placed at the end of a team, it is relaxed. In other words, each time the optimization will have a point, the shortest path estimate d[v] of V is smaller. Therefore, the implementation of the algorithm will make D smaller and smaller. Since we assume that there is no negative weight loop in the graph, each node has the shortest path value. Therefore, the algorithm does not go on indefinitely. As the D value becomes smaller, the algorithm is finished until the shortest path is reached, and the shortest path est