Implement more pathfinding algorithms

[brean]

implement the other algorithms from PathFinding.js

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
• [ ] Bi-directional Breadth-First-Search
• [ ] Bi-directional Best-First
• [ ] Bi-directional Dijkstra

other algorighms

• [ ] D*
• [ ] D* Lite (maybe based on this or this)
• [ ] 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).

also some more from the OpenGenus Cosmos like for example

Non-Grid-based (Navigation Meshes)

• [ ] Recast/Detrour
• [ ] PatrolJS

[brean]

Implemented Bi-Directional A* in https://github.com/brean/python-pathfinding/commit/4c4eb450b266590b4718131543dacd76c685c6cc

[brean]

Implemented IDA* in https://github.com/brean/python-pathfinding/commit/ae1941e71ceb8927803142bea5e96120e136e371

[brean]

use 3D and nav-mash (see https://www.youtube.com/watch?v=9RRjM1yNvy4 )

[SulRash]

I have also been thinking it would be nice to have built-in support for random walks to allow people to just use this library entirely for pathfinding and any control experiments you need to run. I wouldn't mind adding it myself, it should be really simple.

[brean]

@SulRash good idea, maybe even worth its own issue. Feel free to implement and provide a pull request.