Copyright	(C) 2011 Edward Kmett
License	BSD-style (see the file LICENSE)
Maintainer	Edward Kmett <[email protected]>
Stability	experimental
Portability	type families
Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Graph.AdjacencyMatrix

Description

Documentation

newtype AdjacencyMatrix (arr :: Type -> Type -> Type) i a Source #

Constructors

AdjacencyMatrix
Fields runAdjacencyMatrix :: arr (i, i) Bool -> a

Instances

Instances details

Applicative (AdjacencyMatrix arr i) Source #

Instance details

Defined in Data.Graph.AdjacencyMatrix

Methods

pure :: a -> AdjacencyMatrix arr i a #

(<*>) :: AdjacencyMatrix arr i (a -> b) -> AdjacencyMatrix arr i a -> AdjacencyMatrix arr i b #

liftA2 :: (a -> b -> c) -> AdjacencyMatrix arr i a -> AdjacencyMatrix arr i b -> AdjacencyMatrix arr i c #

(*>) :: AdjacencyMatrix arr i a -> AdjacencyMatrix arr i b -> AdjacencyMatrix arr i b #

(<*) :: AdjacencyMatrix arr i a -> AdjacencyMatrix arr i b -> AdjacencyMatrix arr i a #

Functor (AdjacencyMatrix arr i) Source #

Instance details

Defined in Data.Graph.AdjacencyMatrix

Methods

fmap :: (a -> b) -> AdjacencyMatrix arr i a -> AdjacencyMatrix arr i b #

(<$) :: a -> AdjacencyMatrix arr i b -> AdjacencyMatrix arr i a #

Monad (AdjacencyMatrix arr i) Source #

Instance details

Defined in Data.Graph.AdjacencyMatrix

Methods

(>>=) :: AdjacencyMatrix arr i a -> (a -> AdjacencyMatrix arr i b) -> AdjacencyMatrix arr i b #

(>>) :: AdjacencyMatrix arr i a -> AdjacencyMatrix arr i b -> AdjacencyMatrix arr i b #

return :: a -> AdjacencyMatrix arr i a #

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

Instance details

Defined in Data.Graph.AdjacencyMatrix

Associated Types

type Vertex (AdjacencyMatrix arr i)
Instance details Defined in Data.Graph.AdjacencyMatrix type Vertex (AdjacencyMatrix arr i) = i
type Edge (AdjacencyMatrix arr i)
Instance details Defined in Data.Graph.AdjacencyMatrix type Edge (AdjacencyMatrix arr i) = (i, i)

Methods

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

edgeMap :: a -> AdjacencyMatrix arr i (EdgeMap (AdjacencyMatrix arr i) a) 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 #

type Edge (AdjacencyMatrix arr i) Source #

Instance details

Defined in Data.Graph.AdjacencyMatrix

type Edge (AdjacencyMatrix arr i) = (i, i)

type Vertex (AdjacencyMatrix arr i) Source #

Instance details

Defined in Data.Graph.AdjacencyMatrix

type Vertex (AdjacencyMatrix arr i) = i

class Graph g => AdjacencyMatrixGraph (g :: Type -> Type) Source #

Minimal complete definition

edge

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 (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 => 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 #
(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 => 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 => 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 (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, 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, 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 #

ask :: AdjacencyMatrix arr i (arr (i, i) Bool) Source #