MthSc 814: Network Flow Programming

Most documents are in portable document format and can be read or printed using Adobe's Acrobat Reader.

General Information

• Course Information (rev 08/1/09)
  (including syllabus, texts, and grading information).

Assignments

1. Assignment 1 (due 9/2/09) with solution
2. Assignment 2 (due 9/18/09) with solution
3. Assignment 3 (due 10/28/09) with solution
4. Assignment 4 (due 11/11/09) with solution

Tests

1. Test 1 (September 30) outline and solution
2. Test 2 (November 20) outline and solution
3. Final (December 10, 3:00-5:30)

Examples

• Netsolve Documentation

Other Links

• Die Hard (Two Jugs Problem) with Solution
• Operation Everything (what is OR anyway?)
• Big Oh example
• Six Degrees of separation
• Shortest Paths (Cities in Japan)
• Dijkstra's Algorithm (Carla Laffra)
• Heapsort (Mike Copley)