Data.Graph.Class

Documentation

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

Minimal complete definition

vertexMap, edgeMap

Associated Types

type Vertex g :: *

type Edge g :: *

Methods

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

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

Instances

Graph Identity

The empty graph

Associated Types

type Vertex (Identity :: * -> *) :: *

type Edge (Identity :: * -> *) :: *

Methods

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

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

Graph g => Graph (MaybeT g)

Associated Types

type Vertex (MaybeT g :: * -> *) :: *

type Edge (MaybeT g :: * -> *) :: *

Methods

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

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

Graph g => Graph (Dual g)

Associated Types

type Vertex (Dual g :: * -> *) :: *

type Edge (Dual g :: * -> *) :: *

Methods

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

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

Ord i => Graph (AdjacencyList i)

Associated Types

type Vertex (AdjacencyList i :: * -> *) :: *

type Edge (AdjacencyList i :: * -> *) :: *

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)

Associated Types

type Vertex (WriterT m g :: * -> *) :: *

type Edge (WriterT m g :: * -> *) :: *

Methods

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

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

(Graph g, Monoid m) => Graph (WriterT m g)

Associated Types

type Vertex (WriterT m g :: * -> *) :: *

type Edge (WriterT m g :: * -> *) :: *

Methods

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

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

Graph g => Graph (StateT s g)

Associated Types

type Vertex (StateT s g :: * -> *) :: *

type Edge (StateT s g :: * -> *) :: *

Methods

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

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

Graph g => Graph (StateT s g)

Associated Types

type Vertex (StateT s g :: * -> *) :: *

type Edge (StateT s g :: * -> *) :: *

Methods

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

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

Graph g => Graph (IdentityT * g)

Associated Types

type Vertex (IdentityT * g :: * -> *) :: *

type Edge (IdentityT * g :: * -> *) :: *

Methods

vertexMap :: a -> IdentityT * g (VertexMap (IdentityT * g) a)

edgeMap :: a -> IdentityT * g (EdgeMap (IdentityT * g) a)

(Graph g, Error e) => Graph (ErrorT e g)

Associated Types

type Vertex (ErrorT e g :: * -> *) :: *

type Edge (ErrorT e g :: * -> *) :: *

Methods

vertexMap :: a -> ErrorT e g (VertexMap (ErrorT e g) a)

edgeMap :: a -> ErrorT e g (EdgeMap (ErrorT e g) a)

Ord i => Graph (AdjacencyMatrix arr i)

Associated Types

type Vertex (AdjacencyMatrix arr i :: * -> *) :: *

type Edge (AdjacencyMatrix arr i :: * -> *) :: *

Methods

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

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

Graph g => Graph (ReaderT * m g)

Associated Types

type Vertex (ReaderT * m g :: * -> *) :: *

type Edge (ReaderT * m g :: * -> *) :: *

Methods

vertexMap :: a -> ReaderT * m g (VertexMap (ReaderT * m g) a)

edgeMap :: a -> ReaderT * m g (EdgeMap (ReaderT * m g) a)

(Graph g, Monoid w) => Graph (RWST r w s g)

Associated Types

type Vertex (RWST r w s g :: * -> *) :: *

type Edge (RWST r w s g :: * -> *) :: *

Methods

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

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

(Graph g, Monoid w) => Graph (RWST r w s g)

Associated Types

type Vertex (RWST r w s g :: * -> *) :: *

type Edge (RWST r w s g :: * -> *) :: *

Methods

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

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

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)