title: Do we stop Depth First Search if the goal is found in the neighbour nodes?
body: <p>Just trying to get my head around this algorithm. Consider a small tree with a root node and 3 children. With A being root and B C D being it's children and then root B having child E. If the goal was D, do we stop as soon as the root is expanded or do we keep traversing down to E, come back up, then try and expand C before we go to D?</p>