Ordering a DAG, shortest paths with negative edges, all-pairs shortest paths, and when to pick each algorithm over Dijkstra, with traced numeric examples.