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
- 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 where Source #
Minimal definition: source
, target
, and either adjacentVertices
with
or outEdges
= defaultOutEdges
outEdges
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 Int Source #
adjacentVertices :: Vertex g -> g [Vertex g] Source #
Instances
defaultOutEdges :: AdjacencyListGraph g => Vertex g -> g [(Vertex g, Vertex g)] Source #
module Data.Graph.Class