- Visualize multiple pathfinding algorithms:
- A* (A-star)
- Breadth-First Search (BFS)
- Depth-First Search (DFS)
- Dijkstra's Algorithm
- Greedy Best-First Search
- Generate mazes using different algorithms:
- Binary Tree
- Recursive Division
- Eller's Algorithm
- Kruskal's Algorithm
- Recursive Backtracker
- Adjustable visualization speed
- Interactive grid for creating custom obstacles
- React: A JavaScript library for building user interfaces
- TypeScript: A typed superset of JavaScript that compiles to plain JavaScript
- Vite: A build tool that aims to provide a faster and leaner development experience for modern web projects
- Tailwind CSS: A utility-first CSS framework for rapidly building custom user interfaces
- ESLint: A tool for identifying and reporting on patterns found in ECMAScript/JavaScript code
- Context API: For state management across components
src/: Contains the source code for the applicationcomponents/: React components used in the applicationcontext/: React context providers for state managementhooks/: Custom React hookslib/: Contains the implementation of pathfinding and maze generation algorithmsutils/: Utility functions and constants
- Clone the repository
- Install dependencies:
pnpm install
- Start the development server:
pnpm run dev
- Add more robust drawing functionality for manually creating obstacles
- Add intermediate destinations for pathfinding
- Add support for custom weights for different terrain
- Terrain based map generation
- Add support for custom heuristics for A*
- Add support for custom start and end points
This project is licensed under the MIT License - see the LICENSE file for details.