Table 1  Summary of the 15 Algorithms Evaluated
 Abbreviation
             Implementation
     BFM
Bellman-Ford-Moore
     BFP
Bellman-Ford-Moore with Parent--checking
     DKQ
Dijkstra's Naive Implementation
     DKB
Dijkstra's Buckets -- Basic Implementation
     DKM
Dijkstra's Buckets -- Overflow Bag
     DKA
Dijkstra's Buckets -- Approximate
     DKD
Dijkstra's Buckets -- Double
     DKF
Dijkstra's Heap -- Fibonacci
     DKH
Dijkstra's Heap -- k--array
     DKR
Dijkstra's Heap -- R--Heap
     PAP
Graph Growth -- Pape
     TQQ
Graph Growth with Two Queues -- Pallottino
     THR
Threshold Algorithm
     GR1
Topological Ordering -- Basic
     GR2
Topological Ordering -- Distance Updates