3D-Pathfinder is a fluid 3D, easy to understand and a new way to visualize pathfinding algorithms built on Three.js.
Find the live demo here
BFS is a pathfinding algorithm where it starts traversing from a selected node (source or starting node) and traverses the graph layerwise thus exploring the neighbour nodes first. ☑ Shortest path
DFS algorithm is a recursive algorithm that uses the idea of backtracking. It involves exhaustive searches of all the nodes by going ahead, if possible, else by backtracking. ☒ Shortest path
Dijkstra's Algorithm allows you to calculate the shortest path between one node (source or starting node) and every other node in the graph. ☑ Shortest path
A* Search algorithm is a modification of Dijkstra’s Algorithm that is optimized for a single destination and it is one of the best and popular technique used in path-finding. ☑ Shortest path
Bidirectional search is a graph search algorithm that finds a shortest path from an initial vertex to a goal vertex in a directed graph. It runs two simultaneous searches: one forward from the initial state, and one backward from the goal, stopping when the two meet. ☑ Shortest path
Random maze generator has been implemented which generates (walls/obstacles) randomly.
3d-Pathfinder requires Node.js to run. First, clone the repository to your preferred location. Then cd into the cloned directory and run
$ cd /path/to/cloned/directory
$ npm installOnce, the dependencies are installed, run
$ npm startYou now have the live server started at your localhost and can now play around with the code and application.
- ReactJS
- ThreeJS
My main inspiration to develop this project was Clément Mihailescu's Pathfinding project.
- Add more Algorithms
- Add more Maze generation algorithms
- Add new shape (e.g. circle, instead of cube) for visualization