… go ahead and implement DFS. Before we do that, we need a way to represent this graph/tree in code. There are a variety of ways to achieve this but we will use an adjacency list. The adjacency list stores;
…y time we add a node to the fringe, we will use the nodes depth in the tree as it’s priority level. So that way when deciding which nodes on the fringe to explore next we simply get the next node form the priority queue.