AN IMPROVED SPFA ALGORITHM FOR SINGLE SOURCE SHORTEST PATH PROBLEM USING FORWARD STAR DATA STRUCTURE

International Journal of Managing Information Technology (IJMIT)


ISSN: 0975-5586 (Online); 0975-5926 (Print)


Article:

AN IMPROVED SPFA ALGORITHM FOR SINGLE SOURCE SHORTEST PATH PROBLEM USING FORWARD STAR DATA STRUCTURE

Authors

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

Paper URL: 
Current Issue URL:

Comments

Popular posts from this blog

Engineering Life Cycle Enables Penetration Testing and Cyber Operations

Network Media Attention and Green Technology Innovation