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
Language	Haskell98

Data.Graph.AdjacencyMatrix

Description

Documentation

newtype AdjacencyMatrix arr i a #

Constructors

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

Instances

Monad (AdjacencyMatrix arr i) #
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 # fail :: String -> AdjacencyMatrix arr i a #
Functor (AdjacencyMatrix arr i) #
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 #
Applicative (AdjacencyMatrix arr i) #
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 #
Ord i => Graph (AdjacencyMatrix arr i) #
Instance details Defined in Data.Graph.AdjacencyMatrix Associated Types type Vertex (AdjacencyMatrix arr i) :: Type # type Edge (AdjacencyMatrix arr i) :: Type # Methods vertexMap :: a -> AdjacencyMatrix arr i (VertexMap (AdjacencyMatrix arr i) a) # edgeMap :: a -> AdjacencyMatrix arr i (EdgeMap (AdjacencyMatrix arr i) a) #
(IArray arr Bool, Ix i) => AdjacencyMatrixGraph (AdjacencyMatrix arr i) #
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))) #
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)

class Graph g => AdjacencyMatrixGraph g #

Minimal complete definition

edge

Instances

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

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