Tree Search / Graph Problem. Please help solve

Consider the map above. You are starting from Boynton Labs on the right and you want to go to the US military base, going through the city of ALDER WOOD after leaving the lab. Represent the map above as a graph. Find the search tree using a breadth first search strategy. Find the number of nodes you will have to visit in order to get to your destination, list them. Find the search tree using depth first search strategy. Find the number of nodes you will have to visit in order to get to your destination, list them. Which search strategy is better