24 Single-Source Shortest Paths 24.1 The Bellman-Ford algorithm 24.2 Single-source shortest paths in directed acyclic graphs 24.3 Dijkstra's algorithm 24.4 Difference constraints and shortest paths 24.5 Proofs of shortest-paths properties Problems