Liking cljdoc? Tell your friends :D
Clojure only.
fogus.rv.search.graph
A* search implementation.
A* search implementation.
astarclj
(astar graph start-node goal-node)Implements a lazy A* best-first graph traversal algorithm. Takes a
graph object implementing both of the fogus.rv.search.GraphSearch
and fogus.rv.search.HeuristicSearch protocols and a start-node
and goal-node describing the bounds of the search. Returns of map
with keys :path mapped to a sequence of nodes from start-node to
goal-node and :cost describing the cost of the path. This search
guarantees to return the lowest cost path as long as one exists.
In the event that there is no path to the goal-node the current result
is undefined.
Implements a lazy A* best-first graph traversal algorithm. Takes a `graph` object implementing both of the `fogus.rv.search.GraphSearch` and `fogus.rv.search.HeuristicSearch` protocols and a `start-node` and `goal-node` describing the bounds of the search. Returns of map with keys `:path` mapped to a sequence of nodes from `start-node` to `goal-node` and `:cost` describing the cost of the path. This search guarantees to return the lowest cost path as long as one exists. In the event that there is no path to the `goal-node` the current result is undefined.
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close