CS 240: Algorithms and Data Structures
James Madison University, Fall 2017

Starter Code

Basic Graph Functionality (Without iterators) (60%)

Implement the constructor as well as the methods for setting and checking edges.

Iterators (30%)

The graph class provides two iterators: one to iterate over all of the vertices in the graph, the other to iterator all of the neighbors of a particular vertex.

Graph Algorithms (10%)

These methods will give you some practice writing simple graph algorithms using your new Graph class.

Submitting

Submit Graph.java and GraphAlgorithms.java through Web-CAT.