BFS (Breadth-First Search): Explores nodes level by level using a queue. Good for finding shortest paths.
DFS (Depth-First Search): Explores as far as possible along each branch using a stack. Good for cycle detection.