Path Finding Algorithms

Table of Contents

• Description
• Prerequisites
• Installing the project
• Using Path Finding
• Features
• Contributing
• Authors
• Contact
• License

Description

• Path finding algorithms implementation using React, TypeScript, Vite, TailwindCSS, and Anime.js.

Prerequisites

Ensure you have met the following requirements:

• Node v20.8.0 or later.
• pnpm 8.12.1 or later.

Installing the project

• Clone or download as ZIP this repository.
• Open repository folder.
• Install the dependencies: pnpm install
• Run the development server: pnpm dev

Using Path Finding

• 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.

Features

• 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)

Contributing

1. Fork and clone the repository.
2. Create a branch: git checkout -b <branch_name>
3. Make your contribution and commit: git commit -m'<commit_message>'
4. Push it to GitHub: git push origin <project>/<location>
5. 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.

Authors

• Mert Türkmenoğlu

Contact

• @mertturkmenoglu on GitHub
• @mert-turkmenoglu on LinkedIn
• @mertturkmenoglu on Medium
• @capreaee on Twitter

License

• This project uses the following license: MIT