Implement more pathfinding algorithms #3
Description
implement the other algorithms from PathFinding.js
Grid-based
from Pathfinding.js
- Bi-directional A*
- Iterative Deeping A Star (IDA*)
- Jump Point Search
- Orthogonal Jump Point Search
- Breadth-First-Search
- Best-First
- Bi-directional Breadth-First-Search
- Bi-directional Best-First
- Bi-directional Dijkstra
- ARA-*
other algorighms
- D*
- D* Lite (maybe based on this or this)
- Any-angle path planning (maybe needs another visualization?)
- Theta* ( see add ThetaStar qiao/PathFinding.js#89 )
- Floyd-Warshall
- Minimum spanning trees
- rapidly exploring random tree (RRT).
- IDDFSFinder
also some more from the OpenGenus Cosmos like for example