Copyright | (C) 2011 Edward Kmett |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | Edward Kmett <ekmett@gmail.com> |
Stability | experimental |
Portability | type families |
Safe Haskell | Safe |
Language | Haskell98 |
Functions and data structures common to graph search algorithms
- data GraphSearch g m = GraphSearch {
- enterVertex :: Vertex g -> g m
- enterEdge :: Edge g -> g m
- grayTarget :: Edge g -> g m
- exitVertex :: Vertex g -> g m
- blackTarget :: Edge g -> g m
Documentation
data GraphSearch g m Source
Graph search visitor
GraphSearch | |
|
Graph g => Monad (GraphSearch g) Source | |
Graph g => Functor (GraphSearch g) Source | |
Graph g => Applicative (GraphSearch g) Source | |
(Graph g, Monoid m) => Monoid (GraphSearch g m) Source |