https://github.com/buarki/maze-master
Create and solve mazes using graph algorithms
https://github.com/buarki/maze-master
astar bfs dijkstra graphs-algorithms maze-solver
Last synced: 4 months ago
JSON representation
Create and solve mazes using graph algorithms
- Host: GitHub
- URL: https://github.com/buarki/maze-master
- Owner: buarki
- Created: 2024-01-02T01:14:59.000Z (over 1 year ago)
- Default Branch: master
- Last Pushed: 2024-05-12T11:29:04.000Z (about 1 year ago)
- Last Synced: 2024-12-24T20:36:28.963Z (6 months ago)
- Topics: astar, bfs, dijkstra, graphs-algorithms, maze-solver
- Language: TypeScript
- Homepage: https://maze-master.vercel.app
- Size: 104 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# maze master
## Description
Maze master is a funny app to create mazes and solve them with famous graph algorithms. The list with algorithm available now and soon can be found bellow:
|Algorithm|available|
|:---:|:--:|
|BFS (Breadth-First Search)|YES|
|DFS (Depth-First Search)|YES|
|Dijkstra|YES|
|A*|YES|
## Running locally
```sh
npm i
npm run dev
```
## Adding a new algorithm
All contributions are wellcome! In case you want to add a new algorithm just add the implementation at the [path-finders](./src/lib/path-finders/) directory and update the list of [available algorithms](./src//lib/path-finders/index.ts). As long as your implementation respects the inteface **PathFindingAlgorithm** it should be fine. And a concrete example is the [BFS implementation](./src/lib/path-finders/bfs.ts).