Consistency
Potentials give non-negative reduced weights. Dijkstra applicable.
Advertisement
Johnson's algorithm
Bellman-Ford from dummy source computes potentials. Then V Dijkstras on reweighted graph. All-pairs shortest paths.
Advertisement
ALT (A* Landmarks + Triangle)
Precompute distances to landmarks. Landmark triangle inequality → potentials. Point-to-point queries fast.
Complexity
Depends on preprocessing choice. Point-to-point: ms on continent-scale.