Last Modified: Wednesday, November 20, 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 F a l l 2 0 0 2 |
NO! If we test with a main() that does not call heapsort at Well one reason might be if you are heapifying as you are
The wording "should" is not a suggestion. If you don't include
them
It returns false when it reaches the EOF (end of file)
We need to establish some rules:
No. I am thinking color number 1,2,3,4. You can always pass
It sets the degree of vertex v based upon the number of
My mistake. It should be public. Since you can't use it
Don't worry about the info on this. Compiler must be
Yes. It has been updated in Adjlist.h>
We have a script that will determine if you have a correct minimal coloring.
Project #5 is due by 11pm on Monday, December 9th.
If your program uses a brute force method to search for all
possible N-colorings it will lose 30 points.
The first set of outputs will be diffed. (After the heapsort.)
printit() should not call heapsort(). You can test printit()
all, your code will fail.
reading. The reader() should ONLY read. heapSort() only sorts.
It is not called from another function.
you lose points for each one not included. AdjlistUnit.cpp, for
example, should be the main() that you used to test Adjlist.cpp.
That means it calls all 10 public functions and prints out
appropriate messages.
By the way, I've changed the primary output to reflect these new
rules.
and both children are 2) choose the RIGHT child.
instead of Graph::assignColor(int v,int c)?
a char as an int without problems.
when setting the size of the adjacency list?
elements in the adjacency list.
to determine the intersection of 2 nodes unless it's
public, it isn't helpful. This will be changed in the
Adjlist.h.
in Node not being virtual. What's up?
complaining about Node and GNode both having reader() and
writer() functions so it thinks the base class functions
should be virtual. Ergo - a virtual base class destructor.
but I have the correct number of colors and a correct coloring?
So your vertex colors don't have to match our vertex colors
exactly.
on the input to print as is. But when we run our main() we
will call heapsort() before calling printit().
You need to make certain that you are mimicing the output
file exactly - including lowercase "node" with open
parenthesis
immediately following it (with no space) in the 2nd set of output.
|
See the class syllabus for policies concerning email Last Modified: Wednesday, November 20, 2002 |
|
|
|
|
|