Transhipment and Shortest Paths

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Introduces Dijkstra's algorithm and probabilistic analysis through the Hiring Problem.

Explores dynamic programming strategies for finding shortest paths in networks with various algorithms and complexities.

Covers basic algorithm ingredients, search algorithms, control structures, and algorithm correctness.

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.