Last Modified: Thursday May 9 10:16 EDT 2002
|
C M S C 2 1 4 C o m p u t e r S c i e n c e I I S p r i n g 2 0 0 2 |
Project #5 is due by 11pm on Thursday, May 9th (however it can be
turned in one day early for a 5 point bonus).
Yes, it has been added to GNode.h.
Store it in Graph.h as a private data member. It has been added
to the template in the posting account.
Sorry about that. The input file was corrected but I forgot to change
the output file. All is correct now.
#include "Node.h" has been fixed in GNode.h and I've also included
"include "GNode.h"" in Graph.h.
If your program uses a brute force method to search for all
possible N-colorings it may take too long and result in a
loss of potentially many points. There is an inherent time
limit. If your program does not solve the problem in a REASONABLE
amount of time, you will lose points. If your program uses an
"efficient" algorithm or heuristic (like the one suggested)
you will not have any problem with the time restriction.
|
See the class syllabus for policies concerning email Last Modified: Thursday May 9 10:16 EDT 2002 |
|
|
|
|
|