| Portability | type families |
|---|---|
| Stability | experimental |
| Maintainer | Edward Kmett <ekmett@gmail.com> |
| Safe Haskell | Safe-Inferred |
Data.Graph.Class.AdjacencyList
Description
- class Graph g => AdjacencyListGraph g where
- defaultOutEdges :: AdjacencyListGraph g => Vertex g -> g [(Vertex g, Vertex g)]
- module Data.Graph.Class
Documentation
class Graph g => AdjacencyListGraph g whereSource
Minimal definition: source, target, and either adjacentVertices with outEdges = defaultOutEdgesoutEdges
Methods
source :: Edge g -> g (Vertex g)Source
target :: Edge g -> g (Vertex g)Source
outEdges :: Vertex g -> g [Edge g]Source
outDegree :: Vertex g -> g IntSource
adjacentVertices :: Vertex g -> g [Vertex g]Source
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 => 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) |
defaultOutEdges :: AdjacencyListGraph g => Vertex g -> g [(Vertex g, Vertex g)]Source
module Data.Graph.Class