Introduction
This project provides a simple and clear implementation of BFS and DFS algorithms to solve mazes. It is designed for educational purposes, demonstrating how these algorithms can be used to navigate through a maze from a specified start point to an end point.
Features
BFS Implementation: Ensures the shortest path is found (if one exists).
DFS Implementation: Explores as far as possible along each branch before backtracking.
Customizable Input: Supports custom maze definitions via text files.
Visual Representation: Outputs the path found in a visual format.
AlgorithmsBreadth-First Search (BFS)
BFS explores the maze level by level, ensuring the shortest path is found. It uses a queue to manage the nodes to be explored next.
Depth-First Search (DFS)
DFS explores as far as possible along each branch before backtracking. It uses a stack (or recursion) to manage the nodes.
Maze solver
Introduction This project provides a simple and clear implementation of BFS and DFS algorithms to solve mazes. It is designed for educational purposes, demonstrating how these algorithms can be used to navigate through a maze from a specified start point to an end point. Features
Algorithms Breadth-First Search (BFS)
Depth-First Search (DFS)