Faster algorithms for the shortest path problem

Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the radix heap, is proposed for use in this algorithm. On a network with n vertices, m edges, and nonnegative integer arc costs bounded by C, a one-level form of radix heap gives a time bound for Dijkstra's algorithm of . A two-level form of radix heap gives a bound of . A combination of a radix heap and a previously known data structure called a Fibonacci heap gives a bound of . The best previously known bounds are using Fibonacci heaps alone and using the priority queue structure of Van Emde Boas et al.