A* search implementation.
A* search implementation.
(astar start-yx step-est cell-costs)
(estimate-cost step-cost-est sz y x)
(min-by f coll)
(neighbors size yx)
(neighbors deltas size yx)
(path-cost node-cost cheapest-nbr)
(total-cost newcost step-cost-est size y x)
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close