Initial commit.
Made a generic TreeNode class.
Renamed TreeNode to Node and started writing Tree class.
Used Node and Graph classes to build a sample 'kite' graph and added out/ to gitignore.
Now need to implement a queue for Breadth First Search.
Made a QueueNode class and started writing Queue class.
Finished implementing a queue (which hold Node as data).
Added some constructors.
Finished implementing Breadth First Search; will be testing now.
Fixed bugs; now Queue constructor makes null nodes.
About to learn how to make spanning trees.
Now I make spanning trees by deleting edges leading to already visited nodes; may need to copy Nodes so I don't destroy the graph.
visited is no longer a field of the Node class.
Moved a DeepCopy commit to BFS branch.
Reapplied stash about moving DeepCopy into the BFS method in Graph class.
Added another queue to in order to build spanning trees - no need to use an explicit DeepCopy class.
Merged the BFS branch and deleted the 'implements Serializable.'
Cleaned up imports, etc.
Added a TODO file.
Deleted DeepCopy class.