To define a graph, all we need to know are the nodes/vertices and the neighbors for each node.

Given the following graph, where nodes are labeled with numbers and their neighbors are in a list followed by a colon:

1: 2, 3
2: 1, 3, 6
3: 1, 2, 4
4: 3, 5
5: 4
6: 2

1. What would be the order that breadth-first (bfs) search would visit the nodes (search using a queue)?  Assume things get added in ascending order.

2. What would be the order that depth-first (dfs) search would visit the nodes (search using a stack)?  Assume things get added in ascending order.

3. The search algorithm can also be implemented recursively with something like:

search(node n){
  if n hasn't been visited:
	  mark as visited

    for each neighbor i in n:
      if i hasn't been visited:
			  search(i)
}

Notice that there is no data structure required in this case.  Does this implement dfs or bfs?