COMP 572 Project -- Fall 2004

 

There are 4 different possible projects.  Projects 2-4  come in different variations. Each project/variation indicates the maximum size of a group that can work on that project/variation. Click on individual projects for more details. All programs should be written using languages/packages that are "normally" available on either our department Windows or Solaris machines.  When registering your project (see below),  you should indicate what languages/packages you will be using. We will contact you if there is a problem.

If you have any questions concerning the project please send email to the TA at cszz@cs.ust.hk or me at golin@cs.ust.hk. Answers to questions of general interest will be posted on the  PROJECT FAQ

A list of who is registered for which project is maintained here.

A list of the project demo times is maintained here.


  1. Fibonacci Heaps (2 people)
    Implementing  Fibonacci heap algorithm and an animation that shows how the data-structure looks and changes
     
  2. Max Flow   Test Cases
  3. Max-Bipartite Weighted Matching   Test Cases
  4. Simplex  Test Cases

Important Deadlines


Important Details

In your submitted code, the part that implements the algorithm(s)  must be fully and clearly documented so that the marker can read it and understand what each part of the algorithm is doing (and is able to map it to the algorithm)  The GUI does not have to be as fully documented.

All work must be done by your group. That is, no sharing of code between groups is allowed.  All algorithmic code, e.g., the implementations of simplex, the Hungarian algorithm etc., must be written by your group.  With that said,  you may use any off -the-shelf GUI software you find (as long as it has not been developed by any other class group).  In particular,  if you can find good GUIs for implementing basic graph editing (needed for many of the projects) you may  use them.

This page was released on November 19, 2004 and last revised on 12/07/2004 00:42 +0800