Data.Graph.AdjacencyList

Documentation

newtype AdjacencyList i a

Constructors

AdjacencyList

Fields

runAdjacencyList :: Array i [i] -> a

Instances

Monad (AdjacencyList i)

Functor (AdjacencyList i)

Applicative (AdjacencyList i)

Ord i => Graph (AdjacencyList i)

Ix i => AdjacencyListGraph (AdjacencyList i)

type Vertex (AdjacencyList i) = i

type Edge (AdjacencyList i) = (i, i)

class Graph g => AdjacencyListGraph g

Minimal definition: source, target, and either adjacentVertices with outEdges = defaultOutEdges or outEdges

Minimal complete definition

source, target, outEdges

Instances

AdjacencyListGraph Identity

AdjacencyListGraph g => AdjacencyListGraph (MaybeT g)

AdjacencyListGraph g => AdjacencyListGraph (IdentityT g)

BidirectionalGraph g => AdjacencyListGraph (Dual g)

Ix i => AdjacencyListGraph (AdjacencyList i)

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

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

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

AdjacencyListGraph g => AdjacencyListGraph (StateT s g)

AdjacencyListGraph g => AdjacencyListGraph (StateT s g)

AdjacencyListGraph g => AdjacencyListGraph (ReaderT e g)

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

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

ask :: AdjacencyList i (Array i [i])