- Single Source -- shortest path from some vertex s to every other vertex
- Single Destination -- shortest path to some vertex d from every other vertex (reverse direction on edges and run single source algorithm)
- Single Pair -- shortest path from u to v (run single source algorithm with s = u; nothing better asymptotically)
- All Pairs -- shortest path from u to v for every pair of vertices (single source for every vertex, but can do better)