DFS Properties and Complexity

Depth-first search uses little memory but is neither complete nor optimal in general.

What is the main advantage of depth-first search over breadth-first search?