An Improved SPFA Algorithm for Single-Source Shortest Path Problem Using Forward Star Data Structure
Xin Zhou
Department of Economic Engineering, Kyushu University,
Fukuoka 812-8581, Japan
ABSTRACT
We present an improved SPFA algorithm for the single source shortest path problem. For a random graph,
the empirical average time complexity is O(|E|), where |E| is the number of edges of the input network.
SPFA maintains a queue of candidate vertices and add a vertex to the queue only if that vertex is relaxed.
In the improved SPFA, MinPoP principle is employed to improve the quality of the queue. We theoretically
analyse the advantage of this new algorithm and experimentally demonstrate that the algorithm is efficient.
KEYWORDS
SPFA; single source; shortest path; queue; MinPoP principle
More Details
Comments
Post a Comment