Instructor: Gábor Hetyei

Important information:

• Course syllabus
• Homework

Handouts:

• Sample Test 1
• Sample Test 2
• Kruskal's and Prim's algorithm
• Example of the Ford-Fulkerson algorithm getting into an infinite loop and never getting close to the maximum flow value.
• Correction to the Transportation Problem Example in Section 4.5 of our text
• Birkhoff's Theorem (We will discuss it on Monday November 23.)

External links:

• Java applets simulating Dijkstra's algorithm (by Kenji Ikeda).
• Java applets simulating Kruskal's algorithm (by Kenji Ikeda).
• Java applets simulating Prim's algorithm (by Kenji Ikeda).
• Java applets simulating the Ford-Fulkerson algorithm (by Kenji Ikeda).