Depth-First Search
Explore graphs by going as deep as possible before backtracking. Perfect for maze solving and tree traversal.
- Stack-based traversal
- Memory efficient
- Great for pathfinding
Breadth-First Search
Explore graphs level by level and find shortest paths on unweighted graphs.
- Queue-based traversal
- Shortest path guarantee
- Level-order exploration
A* Search(WIP)
Heuristic-guided pathfinding that is both optimal and efficient. Widely used in games, AI, and robotics.
- Heuristic-guided search
- Optimal with admissible heuristic
- Scales well in practice