Data.Graph.Class.AdjacencyMatrix

Documentation

class Graph g => AdjacencyMatrixGraph g where

Minimal complete definition

edge

Methods

edge :: Vertex g -> Vertex g -> g (Maybe (Edge g))

Instances

AdjacencyMatrixGraph Identity

Methods

edge :: Vertex Identity -> Vertex Identity -> Identity (Maybe (Edge Identity))

AdjacencyMatrixGraph g => AdjacencyMatrixGraph (MaybeT g)

Methods

edge :: Vertex (MaybeT g) -> Vertex (MaybeT g) -> MaybeT g (Maybe (Edge (MaybeT g)))

AdjacencyMatrixGraph g => AdjacencyMatrixGraph (Dual g)

Methods

edge :: Vertex (Dual g) -> Vertex (Dual g) -> Dual g (Maybe (Edge (Dual g)))

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

Methods

edge :: Vertex (WriterT m g) -> Vertex (WriterT m g) -> WriterT m g (Maybe (Edge (WriterT m g)))

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

Methods

edge :: Vertex (WriterT m g) -> Vertex (WriterT m g) -> WriterT m g (Maybe (Edge (WriterT m g)))

AdjacencyMatrixGraph g => AdjacencyMatrixGraph (StateT s g)

Methods

edge :: Vertex (StateT s g) -> Vertex (StateT s g) -> StateT s g (Maybe (Edge (StateT s g)))

AdjacencyMatrixGraph g => AdjacencyMatrixGraph (StateT s g)

Methods

edge :: Vertex (StateT s g) -> Vertex (StateT s g) -> StateT s g (Maybe (Edge (StateT s g)))

AdjacencyMatrixGraph g => AdjacencyMatrixGraph (IdentityT * g)

Methods

edge :: Vertex (IdentityT * g) -> Vertex (IdentityT * g) -> IdentityT * g (Maybe (Edge (IdentityT * g)))

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

Methods

edge :: Vertex (ErrorT e g) -> Vertex (ErrorT e g) -> ErrorT e g (Maybe (Edge (ErrorT e g)))

(IArray arr Bool, Ix i) => AdjacencyMatrixGraph (AdjacencyMatrix arr i)

Methods

edge :: Vertex (AdjacencyMatrix arr i) -> Vertex (AdjacencyMatrix arr i) -> AdjacencyMatrix arr i (Maybe (Edge (AdjacencyMatrix arr i)))

AdjacencyMatrixGraph g => AdjacencyMatrixGraph (ReaderT * e g)

Methods

edge :: Vertex (ReaderT * e g) -> Vertex (ReaderT * e g) -> ReaderT * e g (Maybe (Edge (ReaderT * e g)))

(AdjacencyMatrixGraph g, Monoid m) => AdjacencyMatrixGraph (RWST r m s g)

Methods

edge :: Vertex (RWST r m s g) -> Vertex (RWST r m s g) -> RWST r m s g (Maybe (Edge (RWST r m s g)))

(AdjacencyMatrixGraph g, Monoid m) => AdjacencyMatrixGraph (RWST r m s g)

Methods

edge :: Vertex (RWST r m s g) -> Vertex (RWST r m s g) -> RWST r m s g (Maybe (Edge (RWST r m s g)))

module Data.Graph.Class