-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | General A* search algorithm.
--   
--   This is a data-structure independent implementation of A* search.
@package astar
@version 0.0

module Data.Graph.AStar

-- | This function computes an optimal (minimal distance) path through a
--   graph in a best-first fashion, starting from a given starting point.
aStar :: (Ord a, Ord c, Num c) => (a -> Set a) -> (a -> a -> c) -> (a -> c) -> (a -> Bool) -> a -> Maybe [a]
instance (Ord a, Ord c, Show a, Show c) => Show (AStar a c)