Word description Build an astar object from the costs assoc. The assoc keys are edges of the graph, while the corresponding values are assocs whose keys are the edges that can be reached and whose values are the costs to reach those edges. When used with find-path, this astar tuple will use the Dijkstra path finding algorithm which is a particular case of the general A* algorithm.