Graph Search
Basic idea: to search a graph G, we want to visit all G’s vertices in a systematic order (we’ll use the adjacency list).
Will need to designate some v e V as the start vertex.
Will need to mark each vertex we’ve visited as seen in order to detect cycles; so we add the field visited (boolean) to the basic graphnode definition.