A Visualizer for pathfinding algorithms in 3D.
The live demo can be found here.
Dijkstra’s algorithm (weighted)
The father of pathfinding algorithms, it creates a tree of shortest paths from the starting vertex, the source, to all other points in the graph. Guarantees the shortest path!
A* Search algorithm (weighted)
One of the best and a popular technique used in path-finding and graph traversals with heuristic. Guarantees the shortest path!
Breadth-First Search (unwighted)
The algorithm starts at the tree root, and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level. Guarantees the shortest path!
Depth-First Search (unwighted)
The algorithm starts at the root node and explores as far as possible along each branch before backtracking. Does not guarantee the shortest path!
Two methods to generate a maze:
Roam around the world you create in First-Person view and watch the algorithm move under your feet!
Turn on your device's camera to create the walls on the grid from the camera feed! Play around with any image that has some good contrast and see it replicated on the grid.
And playing krunker.io with my friends.
Textures from OpenGameArt.org
Contributions are welcome. Please read CONTRIBUTING.md for more information.
npm install npm run serve
Made with ❤️ in Vue.js