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-Inferred |
Language | Haskell2010 |
Synopsis
- 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 | |
|
Instances
class Graph g => AdjacencyListGraph g Source #
Minimal definition: source
, target
, and either adjacentVertices
with
or outEdges
= defaultOutEdges
outEdges
Instances
ask :: AdjacencyList i (Array i [i]) Source #