implement the [other algorithms from PathFinding.js](https://github.com/qiao/PathFinding.js/tree/master/src/finders) # Grid-based ## from Pathfinding.js - [x] Bi-directional A* - [x] Iterative Deeping A Star (IDA*) - [ ] Jump Point Search - [ ] Orthogonal Jump Point Search - [x] Breadth-First-Search - [x] [Best-First](https://github.com/qiao/PathFinding.js/blob/master/src/finders/BestFirstFinder.js) - [ ] Bi-directional Breadth-First-Search - [ ] Bi-directional Best-First - [ ] Bi-directional Dijkstra - [ ] [ARA-*](https://proceedings.neurips.cc/paper_files/paper/2003/file/ee8fe9093fbbb687bef15a38facc44d2-Paper.pdf) ## other algorighms - [ ] [D*](https://www.cs.cmu.edu/~motionplanning/lecture/AppH-astar-dstar_howie.pdf) - [ ] D* Lite (maybe based on [this](https://github.com/mdeyo/d-star-lite) or [this](https://github.com/avgaydashenko/d_star)) - [ ] [Any-angle path planning](https://en.wikipedia.org/wiki/Any-angle_path_planning) (maybe needs another visualization?) - [ ] Theta* ( see https://github.com/qiao/PathFinding.js/pull/89 ) - [ ] Floyd-Warshall - [x] Minimum spanning trees - [ ] rapidly exploring random tree (RRT). - [ ] [IDDFSFinder](https://www.geeksforgeeks.org/dsa/iterative-deepening-searchids-iterative-deepening-depth-first-searchiddfs/) - [ ] [BMSSP](https://arxiv.org/pdf/2504.17033) also some more from the [OpenGenus Cosmos](https://github.com/OpenGenus/cosmos/tree/master/code/graph_algorithms/src) like for example # Non-Grid-based (Navigation Meshes) - [ ] [Recast/Detrour](https://github.com/masagroup/recastdetour) - [ ] [PatrolJS](https://github.com/nickjanssen/PatrolJS)
implement the other algorithms from PathFinding.js
Grid-based
from Pathfinding.js
other algorighms
also some more from the OpenGenus Cosmos like for example
Non-Grid-based (Navigation Meshes)