https://github.com/hediske/fantastic-path-finder
A path Finder app with map generation made using React Js and Tailwind CSS . It uses Recursive Division or Binary Tree for the Maze generation and Dijkstra , BFS , DFS and A Star for the Path Finding .
https://github.com/hediske/fantastic-path-finder
astar bfs dfs dijkstra recursive-div shortest-path-algorithm
Last synced: about 2 months ago
JSON representation
A path Finder app with map generation made using React Js and Tailwind CSS . It uses Recursive Division or Binary Tree for the Maze generation and Dijkstra , BFS , DFS and A Star for the Path Finding .
- Host: GitHub
- URL: https://github.com/hediske/fantastic-path-finder
- Owner: hediske
- Created: 2024-07-17T03:54:11.000Z (11 months ago)
- Default Branch: main
- Last Pushed: 2024-12-06T17:37:07.000Z (6 months ago)
- Last Synced: 2025-03-24T09:38:53.684Z (2 months ago)
- Topics: astar, bfs, dfs, dijkstra, recursive-div, shortest-path-algorithm
- Language: TypeScript
- Homepage: https://fantastic-path-finder.vercel.app/
- Size: 86.9 KB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
An Path Finding App made with React and Tailwind CSS with some cool animations:
You can :
- Generate A maze using Binary Tree or Recursive Division
- Create a custom Maze
- Find the shortest Path using A star , Dijkstra
- Find a path using DFS or BFS
- toggle the preferred theme.
For the Dijkstra and A Star algorithms , It is well known that the priority queue is the most relevant data structure allowing to retrieve the next pivot in a very low complexity . So the solution is to implement a class for this structure using a heap (array implementation) as TypeScript or JavaScript has a minimal Data Structures library .
You Can check the implementation in this medium article in details:
[Article](https://medium.com/@mohamedhedi.aissi/priority-queue-in-typescript-implementation-updating-priority-of-heap-elements-removing-c35a276f9b1a)