https://github.com/mertturkmenoglu/path-finding-algorithms

Path finding algorithms visualization
https://github.com/mertturkmenoglu/path-finding-algorithms

algorithm astar-algorithm bfs-algorithm dijkstra-algorithm maze maze-generation-algorithms maze-solver pathfinding pathfinding-algorithm react typescript

Last synced: about 1 month ago
JSON representation

Path finding algorithms visualization

• Host: GitHub
• URL: https://github.com/mertturkmenoglu/path-finding-algorithms
• Owner: mertturkmenoglu
• License: mit
• Created: 2019-07-25T23:37:02.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2023-12-24T00:08:02.000Z (about 1 year ago)
• Last Synced: 2023-12-24T12:23:46.005Z (about 1 year ago)
• Topics: algorithm, astar-algorithm, bfs-algorithm, dijkstra-algorithm, maze, maze-generation-algorithms, maze-solver, pathfinding, pathfinding-algorithm, react, typescript
• Language: TypeScript
• Homepage: https://pathvis.vercel.app
• Size: 1.07 MB
• Stars: 5
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Path Finding Algorithms

# Table of Contents

- [Description](#Description)

- [Prerequisites](#Prerequisites)

- [Installing the project](#installing-the-project)

- [Using Path Finding](#using-path-finding)

- [Features](#Features)

- [Contributing](#Contributing)

- [Authors](#Authors)

- [Contact](#Contact)

- [License](#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 `

3. Make your contribution and commit: `git commit -m''`

4. Push it to GitHub: `git push origin /`

5. Create a pull request (See this page if you need help: [GitHub Pull Request Help](https://help.github.com/en/github/collaborating-with-issues-and-pull-requests/about-pull-requests))

All ideas and helps are welcome. For more, please contact with me.

# Authors

- Mert Türkmenoğlu

# Contact

- [@mertturkmenoglu](https://github.com/mertturkmenoglu) on **GitHub**

- [@mert-turkmenoglu](https://www.linkedin.com/in/mert-turkmenoglu/) on **LinkedIn**

- [@mertturkmenoglu](https://medium.com/@mertturkmenoglu) on **Medium**

- [@capreaee](https://twitter.com/capreaee) on **Twitter**

# License

- This project uses the following license: [MIT](https://opensource.org/license/mit/)