Data.Graph.AdjacencyMatrix

Documentation

newtype AdjacencyMatrix arr i a

Constructors

AdjacencyMatrix

Fields

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

Instances

Monad (AdjacencyMatrix arr i)

Functor (AdjacencyMatrix arr i)

Applicative (AdjacencyMatrix arr i)

Ord i => Graph (AdjacencyMatrix arr i)

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

type Vertex (AdjacencyMatrix arr i) = i

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

class Graph g => AdjacencyMatrixGraph g

Minimal complete definition

edge

Instances

AdjacencyMatrixGraph Identity

AdjacencyMatrixGraph g => AdjacencyMatrixGraph (MaybeT g)

AdjacencyMatrixGraph g => AdjacencyMatrixGraph (IdentityT g)

AdjacencyMatrixGraph g => AdjacencyMatrixGraph (Dual g)

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

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

AdjacencyMatrixGraph g => AdjacencyMatrixGraph (StateT s g)

AdjacencyMatrixGraph g => AdjacencyMatrixGraph (StateT s g)

AdjacencyMatrixGraph g => AdjacencyMatrixGraph (ReaderT e g)

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

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

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

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

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