I've written DFS, and it works, but the code feels like its badly designed. The Graph is implemented as an array of nodes with a list of edges. The assignment is to print the nodes in depth first ...