Portability | type families |
---|---|
Stability | experimental |
Maintainer | Edward Kmett <ekmett@gmail.com> |
Safe Haskell | Safe-Inferred |
- newtype AdjacencyList i a = AdjacencyList {
- runAdjacencyList :: Array i [i] -> a
- class Graph g => AdjacencyListGraph g
- ask :: AdjacencyList i (Array i [i])
Documentation
newtype AdjacencyList i a Source
AdjacencyList | |
|
Monad (AdjacencyList i) | |
Functor (AdjacencyList i) | |
Applicative (AdjacencyList i) | |
Ord i => Graph (AdjacencyList i) | |
Ix i => AdjacencyListGraph (AdjacencyList i) |
class Graph g => AdjacencyListGraph g Source
Minimal definition: source
, target
, and either adjacentVertices
with
or outEdges
= defaultOutEdges
outEdges
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 => AdjacencyListGraph (StateT s g) | |
AdjacencyListGraph g => AdjacencyListGraph (StateT s g) | |
AdjacencyListGraph g => AdjacencyListGraph (ReaderT e g) | |
(AdjacencyListGraph g, Error e) => AdjacencyListGraph (ErrorT 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])Source