Assignment 3 (BFS and DFS)

QUESTION
Implement BFS and DFS to find a path from a start node to a goal node, and print their traversal orders. Use the submitted A-H graph with start A and goal H. Explain which algorithm guarantees the shortest path.

SOURCE NOTE
Condensed from the Lab 3 document and submitted code. BFS guarantees the fewest edges for an unweighted graph; DFS does not guarantee a shortest path.
