====================
== Project Status ==
====================
Group:
Brendan Coffey
Brian Mollo
Matt Cox
Edmund Racke

My Job:

	I created Flatten.beh for the flattening of a Class_graph.

Rest of what happened:

Trying to get my code to modify the Class_graph correctly. 
Recieved inspiration from Ed McCormick's group.

Issues:

1. What traversal to use to best gather the common data and then 
move down to the leaf nodes of the Class_graph.

2.  Returning the hash map for global use.

Done:

  Flattening is *mostly* working. What seems to be happening is 
that only the first adjacent term is getting modified. Most likely 
because the common Any_vertex_list is getting reset, but I have 
been unable to work around this problem.

  Here is an exam of the bug in flatten:

This input:
		B : C | D common <h> H.
		C = String E.
		D = .
		H = .

*Should* produce this output:
		B : C | D .
		C = String E <h> H.
		D = <h> H.
		H = .

But it produces this instead:
		B : C | D .
		C = String E <h> H.
		D = .
		H = .

Not too bad, but it prevented me from getting to work on Terminal Buffer Rule. :-(