What are DFS and BFS algorithms used for?

DFS (Depth-First Search) explores as deep as possible before backtracking, using a stack or recursion. Used for: path finding, cycle detection, topological sorting, maze solving. BFS (Breadth-First Search) explores all neighbors at current depth before going deeper, using a queue. Used for: shortest path in unweighted graphs, level-order traversal, finding connected components. Both are O(V+E) for graphs.