graphs-0.7.3: 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-Inferred
LanguageHaskell2010

Data.Graph.Class

Description

 

Documentation

class (Monad g, Eq (Vertex g), Eq (Edge g)) => Graph g where Source #

Associated Types

type Vertex g :: * Source #

type Edge g :: * Source #

Methods

vertexMap :: a -> g (VertexMap g a) Source #

edgeMap :: a -> g (EdgeMap g a) Source #

Instances

Instances details
Graph Identity Source #

The empty graph

Instance details

Defined in Data.Graph.Class

Associated Types

type Vertex Identity Source #

type Edge Identity Source #

Methods

vertexMap :: a -> Identity (VertexMap Identity a) Source #

edgeMap :: a -> Identity (EdgeMap Identity a) Source #

Ord i => Graph (AdjacencyList i) Source # 
Instance details

Defined in Data.Graph.AdjacencyList

Associated Types

type Vertex (AdjacencyList i) Source #

type Edge (AdjacencyList i) Source #

Methods

vertexMap :: a -> AdjacencyList i (VertexMap (AdjacencyList i) a) Source #

edgeMap :: a -> AdjacencyList i (EdgeMap (AdjacencyList i) a) Source #

Graph g => Graph (Dual g) Source # 
Instance details

Defined in Data.Graph.Dual

Associated Types

type Vertex (Dual g) Source #

type Edge (Dual g) Source #

Methods

vertexMap :: a -> Dual g (VertexMap (Dual g) a) Source #

edgeMap :: a -> Dual g (EdgeMap (Dual g) a) Source #

Graph g => Graph (MaybeT g) Source # 
Instance details

Defined in Data.Graph.Class

Associated Types

type Vertex (MaybeT g) Source #

type Edge (MaybeT g) Source #

Methods

vertexMap :: a -> MaybeT g (VertexMap (MaybeT g) a) Source #

edgeMap :: a -> MaybeT g (EdgeMap (MaybeT g) a) Source #

Ord i => Graph (AdjacencyMatrix arr i) Source # 
Instance details

Defined in Data.Graph.AdjacencyMatrix

Associated Types

type Vertex (AdjacencyMatrix arr i) Source #

type Edge (AdjacencyMatrix arr i) Source #

Methods

vertexMap :: a -> AdjacencyMatrix arr i (VertexMap (AdjacencyMatrix arr i) a) Source #

edgeMap :: a -> AdjacencyMatrix arr i (EdgeMap (AdjacencyMatrix arr i) a) Source #

Graph g => Graph (IdentityT g) Source # 
Instance details

Defined in Data.Graph.Class

Associated Types

type Vertex (IdentityT g) Source #

type Edge (IdentityT g) Source #

Methods

vertexMap :: a -> IdentityT g (VertexMap (IdentityT g) a) Source #

edgeMap :: a -> IdentityT g (EdgeMap (IdentityT g) a) Source #

Graph g => Graph (ReaderT m g) Source # 
Instance details

Defined in Data.Graph.Class

Associated Types

type Vertex (ReaderT m g) Source #

type Edge (ReaderT m g) Source #

Methods

vertexMap :: a -> ReaderT m g (VertexMap (ReaderT m g) a) Source #

edgeMap :: a -> ReaderT m g (EdgeMap (ReaderT m g) a) Source #

Graph g => Graph (StateT s g) Source # 
Instance details

Defined in Data.Graph.Class

Associated Types

type Vertex (StateT s g) Source #

type Edge (StateT s g) Source #

Methods

vertexMap :: a -> StateT s g (VertexMap (StateT s g) a) Source #

edgeMap :: a -> StateT s g (EdgeMap (StateT s g) a) Source #

Graph g => Graph (StateT s g) Source # 
Instance details

Defined in Data.Graph.Class

Associated Types

type Vertex (StateT s g) Source #

type Edge (StateT s g) Source #

Methods

vertexMap :: a -> StateT s g (VertexMap (StateT s g) a) Source #

edgeMap :: a -> StateT s g (EdgeMap (StateT s g) a) Source #

(Graph g, Monoid m) => Graph (WriterT m g) Source # 
Instance details

Defined in Data.Graph.Class

Associated Types

type Vertex (WriterT m g) Source #

type Edge (WriterT m g) Source #

Methods

vertexMap :: a -> WriterT m g (VertexMap (WriterT m g) a) Source #

edgeMap :: a -> WriterT m g (EdgeMap (WriterT m g) a) Source #

(Graph g, Monoid m) => Graph (WriterT m g) Source # 
Instance details

Defined in Data.Graph.Class

Associated Types

type Vertex (WriterT m g) Source #

type Edge (WriterT m g) Source #

Methods

vertexMap :: a -> WriterT m g (VertexMap (WriterT m g) a) Source #

edgeMap :: a -> WriterT m g (EdgeMap (WriterT m g) a) Source #

(Graph g, Monoid w) => Graph (RWST r w s g) Source # 
Instance details

Defined in Data.Graph.Class

Associated Types

type Vertex (RWST r w s g) Source #

type Edge (RWST r w s g) Source #

Methods

vertexMap :: a -> RWST r w s g (VertexMap (RWST r w s g) a) Source #

edgeMap :: a -> RWST r w s g (EdgeMap (RWST r w s g) a) Source #

(Graph g, Monoid w) => Graph (RWST r w s g) Source # 
Instance details

Defined in Data.Graph.Class

Associated Types

type Vertex (RWST r w s g) Source #

type Edge (RWST r w s g) Source #

Methods

vertexMap :: a -> RWST r w s g (VertexMap (RWST r w s g) a) Source #

edgeMap :: a -> RWST r w s g (EdgeMap (RWST r w s g) a) Source #

type VertexMap g = PropertyMap g (Vertex g) Source #

type EdgeMap g = PropertyMap g (Edge g) Source #

liftVertexMap :: (MonadTrans t, Graph (t g), Graph g, Vertex (t g) ~ Vertex g) => a -> t g (VertexMap (t g) a) Source #

liftEdgeMap :: (MonadTrans t, Graph (t g), Graph g, Edge (t g) ~ Edge g) => a -> t g (EdgeMap (t g) a) Source #