This app visualizes path finding algorithms and maze generators, deployed project here. (with firebase)
Performance issues may be present in larger screens
Can generate simple mazes both with animation enabled/disabled
Weights can be enabled/disabled before generation
Can find path from one point to any other point. Start/End position can be changed by selecting the current node and clicking on another target.
Dijkstra takes the weights into account (if there is no weights it will act like BFS )
Speed (of the path finding) can be changed in the middle of the run and also wall can be added or removed at the middle of the run.
Adding/Removing walls in visited area will not the graph - meaning it can be broken
clone and install the dependencies
git clone git@github.com:DimaTc/graph-traveler.git
npm ithen just start the development server by yarn start or npm start
Be advised, it is much slower when the app is in development mode.
Just open the index.html file in build and enjoy!
If any code is updated, you should yarn build or npm build first.
- Add A* finding algorithm
- Add recursive maze generator