ú·¼ cThis function computes an optimal (minimal distance) path through a graph in a best-first fashion, ' starting from a given starting point. FThe graph we are searching through, given as a function from vertices  to their neighbours. HDistance function between neighbouring vertices of the graph. This will K never be applied to vertices that are not neighbours, so may be undefined 0 on pairs that are not neighbours in the graph. MHeuristic distance to the (nearest) goal. This should never overestimate the 6 distance, or else the path found may not be minimal. 8The goal, specified as a boolean predicate on vertices. $The vertex to start searching from. HAn optimal path, if any path exists. This excludes the starting vertex. cThis function computes an optimal (minimal distance) path through a graph in a best-first fashion, ' starting from a given starting point. FThe graph we are searching through, given as a function from vertices  to their neighbours. HDistance function between neighbouring vertices of the graph. This will K never be applied to vertices that are not neighbours, so may be undefined 0 on pairs that are not neighbours in the graph. MHeuristic distance to the (nearest) goal. This should never overestimate the 6 distance, or else the path found may not be minimal. 8The goal, specified as a boolean predicate on vertices. $The vertex to start searching from. HAn optimal path, if any path exists. This excludes the starting vertex.       astar-0.2Data.Graph.AStaraStarAStarvisitedwaitingscorememoHeurcameFromendrunAStar runAStarMaStarMplane planeHole planeDist