Depth-First Search explores graphs and trees by going as deep as possible before backtracking. Ideal for path finding, cycle detection, topological sorting, and exploring all possible paths. Uses a stack (or recursion) to track the exploration frontier.