Corrections/Modifications

• Read the FAQ, it is constantly updated. Read it all the time.
• All corrections will be posted here. No changes to the posting account will occur after Dec 1.
  • * was made public in Adjlist.h
  • isIn() was made const in Adjlist.h
  • If your heapsort doesn't give the same order as ours, you'll not pass primary input.

Checklist

1. Include a README which contains
• A list of all classes you used
• If you used a different coloring algorithm, give an explanation as to
• how your coloring algorithm differs in approach from the heuristic provided
• why it differs
2. Your color() method should be the 1st method in Graph.cpp so we can locate it easily.
3. Your heapsort() and reheapify() should be next in your Graph.cpp file.
4. Include your unit testing files.
5. COMMENTS are the most important part of your code.
• Comment the coloring algorithm particularly well as this is the one that is going to be the most complex.
6. Keep in mind that your methods should be small and specific - do one thing and do it well.
   • Break up functions into small useful bits of code.
   • Let a function call several other functions rather than sticking everything in the same function.
   • This is particulary important in the read and color functions.

See the class syllabus for policies concerning email Last Modified: Wednesday, November 20, 2002

Web Accessibility