| 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 |
Data.Graph.Class
Description
Documentation
class (Monad g, Eq (Vertex g), Eq (Edge g)) => Graph g where #
Instances
| Graph Identity # | The empty graph |
| Graph g => Graph (MaybeT g) # | |
| Graph g => Graph (Dual g) # | |
| Ord i => Graph (AdjacencyList i) # | |
Defined in Data.Graph.AdjacencyList Methods vertexMap :: a -> AdjacencyList i (VertexMap (AdjacencyList i) a) # edgeMap :: a -> AdjacencyList i (EdgeMap (AdjacencyList i) a) # | |
| (Graph g, Monoid m) => Graph (WriterT m g) # | |
| (Graph g, Monoid m) => Graph (WriterT m g) # | |
| Graph g => Graph (StateT s g) # | |
| Graph g => Graph (StateT s g) # | |
| Graph g => Graph (ReaderT m g) # | |
| Graph g => Graph (IdentityT g) # | |
| (Graph g, Error e) => Graph (ErrorT e g) # | |
| Ord i => Graph (AdjacencyMatrix arr i) # | |
Defined in Data.Graph.AdjacencyMatrix Associated Types type Vertex (AdjacencyMatrix arr i) :: Type # type Edge (AdjacencyMatrix arr i) :: Type # Methods vertexMap :: a -> AdjacencyMatrix arr i (VertexMap (AdjacencyMatrix arr i) a) # edgeMap :: a -> AdjacencyMatrix arr i (EdgeMap (AdjacencyMatrix arr i) a) # | |
| (Graph g, Monoid w) => Graph (RWST r w s g) # | |
| (Graph g, Monoid w) => Graph (RWST r w s g) # | |
type VertexMap g = PropertyMap g (Vertex g) #
type EdgeMap g = PropertyMap g (Edge g) #
liftVertexMap :: (MonadTrans t, Graph (t g), Graph g, Vertex (t g) ~ Vertex g) => a -> t g (VertexMap (t g) a) #
liftEdgeMap :: (MonadTrans t, Graph (t g), Graph g, Edge (t g) ~ Edge g) => a -> t g (EdgeMap (t g) a) #