Here is the solution to Project 2.1. I have tested the new myGraph class using a somewhat larger test program, graphTest.java. I have also run experiments.java and wirelessNetwork.java using the new myGraph class. The results obtained from running the Project 1 experiments are in the file exp.out. These results are very similar to the results obtained when using the old myGraph class.
In addition to using the adjacency list representation, the myGraph class also contains the complete implementation of depth first traversal, including the construction of the depth first traversal tree and the ability to process multiple connected components of the graph.