SPQ-Dijkstra is an improvement built around the idea of Dial's
shortest path algorithm. This version of sparse Dijkstra should
work well for the networks, for which the traversal frontier is
not very large, and the set of unique temporary distance labels
(or, very approximately, the set of unique edge costs) is small.

Victor Amelkin <victor@cs.ucsb.edu>