DFS

DFS, or Depth-First Search, is an algorithm used to traverse or search through the nodes of a graph or tree data structure by exploring as far as possible along each branch before backtracking. This method prioritizes depth over breadth, making it ideal for applications like pathfinding in mazes or AI decision trees, but it can sometimes lead to inefficiencies in very large or infinite graphs due to potential stack overflows.