Do you mean heuristic graph traversal algorithms?
Yep. There's a generic implementation of Dijkstra and Bellman @ https://github.com/PhilippeSigaud/dranges
But no A*, D* Lite etc.
Do you mean heuristic graph traversal algorithms?
Yep. There's a generic implementation of Dijkstra and Bellman @ https://github.com/PhilippeSigaud/dranges
But no A*, D* Lite etc.