- Give a graph where depth-first search is much more efficient (expands fewer nodes) than breadth-first search.
- Give a graph where breadth-first search is much better than depth-first search.
- Give a graph where A
search is more efficient than either depth-first search or breadth-first search.^{*} - Give a graph where depth-first search and breadth-first search
are both more efficient than A
search.^{*}

- Give a graph where depth-first search is much more efficient (expands fewer nodes)
than breadth-first search.
Here depth-first search expands every node, whereas breadth-first search expands three nodes:

- Give a graph where breadth-first search is much better than
depth-first search.
Here depth-first search expands every node, whereas breadth-first search expands three nodes:

- Give a graph where A
search is more efficient than either depth-first search or breadth-first search.^{*}Here depth-first search and breadth-first search expand every node, whereas A

search expands 4 nodes.^{*} - Give a graph where depth-first search and breadth-first search
are both more efficient than A
search.^{*}Here depth-first search expands three nodes, breadth-first search expands 4, yet A

search expands every nodes.^{*}

David Poole