COS 226 Programming Assignment Checklist: Baseball Elimination

No partnering up on this last assignment.

Frequently Asked Questions

What should I print out if there is more than one certificate of elimination? Print out any one.

How do I compute the min cut? Review the proof of the max-flow min-cut theorem. It is constructive and tells you how to find a min cut from a max flow.

Input, Output, and Testing

Input and output. Here are a number of sample input files.

Reference solutions.   For reference, we provide executable code for our solution in Windows, Solaris, and OS X.

Submission and readme

Submit everything needed to compile your program. We'll compile with "gcc *.c" and execute it with "a.out < input5.txt".

Here is a template readme.txt file.

Getting started

  • Download the directory baseball. This directory is mirrored on arizona at /u/cs226/pub/baseball. It contains a reference implementation and sample input files. The C code from the max flow lecture includes a graph ADT with an implementation of the Ford-Fulkerson augmenting path algorithm.

  • COS 226 Home Page
    wayne@cs.princeton.edu
    Last modified: April 18, 2003