IE 436 • Midterm • Graphs and Network Flows

What is a network?

Shortest Path Problems

Dijkstra's Algorithm

Example 1

Example 2

Example 3

Example 4

Example 5

Maximum Flow Problems

Minimum Cut

Ford Fulkerson Method (Flow Augmenting Path Algorithm)

Example 1

Example 2

Boss of Network Problems

Example 1

Shortest Path Problem 1

Shortest Path Problem 2

Shortest Path Problem 3

Shortest Path Problem 4

Shortest Path Problem 5

Shortest Path Problem 6

Shortest Path Problem 7

Maximum Flow Problem 1

Maximum Flow Problem 2

Maximum Flow Problem 3

Maximum Flow Problem 4

Maximum Flow Problem 5

Maximum Flow Problem 6

Minimum Cost Flow Problem 1

Minimum Cost Flow Problem 2