- Description
- Prerequisites
- Installing the project
- Using Path Finding
- Features
- Contributing
- Authors
- Contact
- License
- Path finding algorithms implementation using React, TypeScript, Vite, TailwindCSS, and Anime.js.
Ensure you have met the following requirements:
- Node
v20.8.0
or later. - pnpm
8.12.1
or later.
- Clone or download as ZIP this repository.
- Open repository folder.
- Install the dependencies:
pnpm install
- Run the development server:
pnpm dev
- Left mouse click will add or remove objects.
- You can select your algorithm / heuristic from top left corner.
- When you are ready, click to
Start
button.
- Current algorithms:
- A*
- Dijkstra
- Breadth-first Search
- For A* algorithm, you can choose different heuristic approaches:
- Manhattan
- Euclidean
- You can generate mazes. Maze generation algorithm:
- Recursive backtracking(DFS)
- Fork and clone the repository.
- Create a branch:
git checkout -b <branch_name>
- Make your contribution and commit:
git commit -m'<commit_message>'
- Push it to GitHub:
git push origin <project>/<location>
- Create a pull request (See this page if you need help: GitHub Pull Request Help)
All ideas and helps are welcome. For more, please contact with me.
- Mert Türkmenoğlu
- @mertturkmenoglu on GitHub
- @mert-turkmenoglu on LinkedIn
- @mertturkmenoglu on Medium
- @capreaee on Twitter
- This project uses the following license: MIT