title: In what cases would BFS and DFS be more efficient than A* search algorithm?
body: <p>I've tested A* search against Breadth First Searching (BFS) and Depth First Searching (DFS) and I find that fewer nodes are being expanded with A*. </p>
  
  <p>I understand that A* expands paths that are already less expensive by using the heuristic and edge cost function. </p>
  
  <p>In what cases would BFS and DFS be more efficient as compared to A* search algorithm? </p>