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-Inferred
Language	Haskell2010

Data.Graph.Class.AdjacencyMatrix

Description

Documentation

class Graph g => AdjacencyMatrixGraph g where Source #

Methods

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

Instances

Instances details

AdjacencyMatrixGraph Identity Source #
Instance details Defined in Data.Graph.Class.AdjacencyMatrix Methods edge :: Vertex Identity -> Vertex Identity -> Identity (Maybe (Edge Identity)) Source #
AdjacencyMatrixGraph g => AdjacencyMatrixGraph (MaybeT g) Source #
Instance details Defined in Data.Graph.Class.AdjacencyMatrix Methods edge :: Vertex (MaybeT g) -> Vertex (MaybeT g) -> MaybeT g (Maybe (Edge (MaybeT g))) Source #
AdjacencyMatrixGraph g => AdjacencyMatrixGraph (Dual g) Source #
Instance details Defined in Data.Graph.Dual Methods edge :: Vertex (Dual g) -> Vertex (Dual g) -> Dual g (Maybe (Edge (Dual g))) Source #
(AdjacencyMatrixGraph g, Monoid m) => AdjacencyMatrixGraph (WriterT m g) Source #
Instance details Defined in Data.Graph.Class.AdjacencyMatrix Methods edge :: Vertex (WriterT m g) -> Vertex (WriterT m g) -> WriterT m g (Maybe (Edge (WriterT m g))) Source #
(AdjacencyMatrixGraph g, Monoid m) => AdjacencyMatrixGraph (WriterT m g) Source #
Instance details Defined in Data.Graph.Class.AdjacencyMatrix Methods edge :: Vertex (WriterT m g) -> Vertex (WriterT m g) -> WriterT m g (Maybe (Edge (WriterT m g))) Source #
AdjacencyMatrixGraph g => AdjacencyMatrixGraph (StateT s g) Source #
Instance details Defined in Data.Graph.Class.AdjacencyMatrix Methods edge :: Vertex (StateT s g) -> Vertex (StateT s g) -> StateT s g (Maybe (Edge (StateT s g))) Source #
AdjacencyMatrixGraph g => AdjacencyMatrixGraph (StateT s g) Source #
Instance details Defined in Data.Graph.Class.AdjacencyMatrix Methods edge :: Vertex (StateT s g) -> Vertex (StateT s g) -> StateT s g (Maybe (Edge (StateT s g))) Source #
AdjacencyMatrixGraph g => AdjacencyMatrixGraph (ReaderT e g) Source #
Instance details Defined in Data.Graph.Class.AdjacencyMatrix Methods edge :: Vertex (ReaderT e g) -> Vertex (ReaderT e g) -> ReaderT e g (Maybe (Edge (ReaderT e g))) Source #
AdjacencyMatrixGraph g => AdjacencyMatrixGraph (IdentityT g) Source #
Instance details Defined in Data.Graph.Class.AdjacencyMatrix Methods edge :: Vertex (IdentityT g) -> Vertex (IdentityT g) -> IdentityT g (Maybe (Edge (IdentityT g))) Source #
(AdjacencyMatrixGraph g, Error e) => AdjacencyMatrixGraph (ErrorT e g) Source #
Instance details Defined in Data.Graph.Class.AdjacencyMatrix Methods edge :: Vertex (ErrorT e g) -> Vertex (ErrorT e g) -> ErrorT e g (Maybe (Edge (ErrorT e g))) Source #
(IArray arr Bool, Ix i) => AdjacencyMatrixGraph (AdjacencyMatrix arr i) Source #
Instance details Defined in Data.Graph.AdjacencyMatrix Methods edge :: Vertex (AdjacencyMatrix arr i) -> Vertex (AdjacencyMatrix arr i) -> AdjacencyMatrix arr i (Maybe (Edge (AdjacencyMatrix arr i))) Source #
(AdjacencyMatrixGraph g, Monoid m) => AdjacencyMatrixGraph (RWST r m s g) Source #
Instance details Defined in Data.Graph.Class.AdjacencyMatrix 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))) Source #
(AdjacencyMatrixGraph g, Monoid m) => AdjacencyMatrixGraph (RWST r m s g) Source #
Instance details Defined in Data.Graph.Class.AdjacencyMatrix 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))) Source #

module Data.Graph.Class