Forgot to be committing as I got started. Made a Bag linked list class to keep an adjacency list for a vertex, made a Graph class that uses adjacency lists. Bag is tested. Graph class is tested for adding edges. Have implemented a DFS-like function to determine the largest component of a graph and return the vertex numbers of that component. Have started implementing the diameter function, which first calls the largestComponent function.