PathfindR 2.0 | PathfindR Project
PathfindR is a visual sorting program that illustrates how different sorting algorithms operate. PathfindR incorperates a multitude of sorting algorithms listed below and presents the user with a grid which they can alter with walls, beginning / ending nodes, and bombs. This allows the user to make their own layouts and see multiple cases of these algorithms in action! Jump into PatfindR or read more about each algorithm below!
PLEASE NOTE: I am not the originator of this idea Clement Mihailescu, the creator of ALOGEXPERT was the original one to create this project and must be credited with the animations, sprites, and idea. I optimized some of his code and repackaged part of his UI tp give a better user experience. Make sure to check him and his work out!
- 8+ advanced sorting algorithnms
- Beginner friendly visualization UI
- Multiple search nodes
- Area builder for visualization
- Prebuilt mazes and patterns
- Weighted nodes
- Dijkstra's Algorithm: the father of pathfinding algorithms; guarantees the shortest path
- A Search: arguably the best pathfinding algorithm; uses heuristics to guarantee the shortest path much faster than Dijkstra's Algorithm
- Breath-first Search: a great algorithm; guarantees the shortest path.
- Greedy Best-first Search: a faster, more heuristic-heavy version of A*; does not guarantee the shortest path
- Swarm Algorithm: a mixture of Dijkstra's Algorithm and A*; does not guarantee the shortest-path.
- Convergent Swarm Algorithm: the faster, more heuristic-heavy version of Swarm; does not guarantee the shortest path.
- Bidirectional Swarm Algorithm: Swarm from both sides; does not guarantee the shortest path.
- Depth-first Search: a very bad algorithm for pathfinding; does not guarantee shortest path.
- PathfindR and this repositor was created by Alexander Tomsovic
- Engineered by A.R.T. LLC
- Requests for feature implementations and comments can be mailed to [email protected].
- You can visit our Instagrma @pathfindr.io
Thank you!