Topic: Shortest Paths

Priority Queues And Dijkstra’s Running Time

Path Costs, Distance Labels, And Unreachable Vertices

Floyd-Warshall Correctness And Negative Cycles

Edge Relaxation And Distance Inequalities

Dijkstra’s Algorithm For Nonnegative Weights

Detecting Reachable Negative Cycles

Correctness Of Topological-Order Relaxation

Computing All-Pairs Distances With Floyd-Warshall

Comparing Shortest-Path Algorithms And Their Costs

Choosing And Applying A Shortest-Path Algorithm