This code has a Breadth First Search, Depth First Search, and Dijkstra's shortest path algorithm that are used on a Graph class. Both are written iteratively. The Graph class is written using an ...