graphs-0.7: A simple monadic graph library

Copyright(C) 2011 Edward Kmett
LicenseBSD-style (see the file LICENSE)
MaintainerEdward Kmett <ekmett@gmail.com>
Stabilityexperimental
Portabilitytype families
Safe HaskellSafe
LanguageHaskell98

Data.Graph.Algorithm

Description

Functions and data structures common to graph search algorithms

Synopsis

Documentation

data GraphSearch g m #

Graph search visitor

Constructors

GraphSearch 

Fields

Instances

Graph g => Monad (GraphSearch g) # 

Methods

(>>=) :: GraphSearch g a -> (a -> GraphSearch g b) -> GraphSearch g b #

(>>) :: GraphSearch g a -> GraphSearch g b -> GraphSearch g b #

return :: a -> GraphSearch g a #

fail :: String -> GraphSearch g a #

Graph g => Functor (GraphSearch g) # 

Methods

fmap :: (a -> b) -> GraphSearch g a -> GraphSearch g b #

(<$) :: a -> GraphSearch g b -> GraphSearch g a #

Graph g => Applicative (GraphSearch g) # 

Methods

pure :: a -> GraphSearch g a #

(<*>) :: GraphSearch g (a -> b) -> GraphSearch g a -> GraphSearch g b #

(*>) :: GraphSearch g a -> GraphSearch g b -> GraphSearch g b #

(<*) :: GraphSearch g a -> GraphSearch g b -> GraphSearch g a #

(Graph g, Monoid m) => Monoid (GraphSearch g m) # 

Methods

mempty :: GraphSearch g m #

mappend :: GraphSearch g m -> GraphSearch g m -> GraphSearch g m #

mconcat :: [GraphSearch g m] -> GraphSearch g m #