8000 Tags · kjkrol/hpastar · GitHub
[go: up one dir, main page]

Skip to content

Tags

Tags

v1.5.0

Toggle v1.5.0's commit message
v1.5.0: Search.Abstract: a route's entrances with the cost of each jump

v1.4.0

Toggle v1.4.0's commit message
v1.4.0: classes, one Solver serving up to 8 of them, each as a graph …

…of its own steps

v1.3.0

Toggle v1.3.0's commit message
v1.3.0: hpastar, one Solver over any graph, long paths by HPA* where …

…its states lie in a plane

v1.2.0

Toggle v1.2.0's commit message
v1.2.0: a search's states in arrays by an integer id, a heap of keys …

…and ids, one dictionary

v1.1.3

Toggle v1.1.3's commit message
v1.1.3: Solver.Wipe wipes the stamps ahead of time, between two searches

v1.1.2

Toggle v1.1.2's commit message
v1.1.2: stamps a byte each, SolveInto/ResultInto, the slice dictionar…

…y reset by a stamp

v1.1.1

Toggle v1.1.1's commit message
fix: Solve returns nil if target unreachable

v1.1.0

Toggle v1.1.0's commit message
Unify naming conventions and fix examples

v1.0.4

Toggle v1.0.4's commit message
Introduce Transitions funcion

v1.0.3

Toggle v1.0.3's commit message
Pass parent to SuccessorsFunc to prevent backtracking

0