Copyright	(C) 2011 Edward Kmett
License	BSD-style (see the file LICENSE)
Maintainer	Edward Kmett <[email protected]>
Stability	experimental
Portability	type families
Safe Haskell	Safe
Language	Haskell98

Data.Graph.Class.AdjacencyList

Description

Synopsis

Documentation

class Graph g => AdjacencyListGraph g where Source #

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

Minimal complete definition

source, target, outEdges

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 Int Source #

adjacentVertices :: Vertex g -> g [Vertex g] Source #

Instances

AdjacencyListGraph Identity Source #
Methods source :: Edge Identity -> Identity (Vertex Identity) Source # target :: Edge Identity -> Identity (Vertex Identity) Source # outEdges :: Vertex Identity -> Identity [Edge Identity] Source # outDegree :: Vertex Identity -> Identity Int Source # adjacentVertices :: Vertex Identity -> Identity [Vertex Identity] Source #
AdjacencyListGraph g => AdjacencyListGraph (MaybeT g) Source #
Methods source :: Edge (MaybeT g) -> MaybeT g (Vertex (MaybeT g)) Source # target :: Edge (MaybeT g) -> MaybeT g (Vertex (MaybeT g)) Source # outEdges :: Vertex (MaybeT g) -> MaybeT g [Edge (MaybeT g)] Source # outDegree :: Vertex (MaybeT g) -> MaybeT g Int Source # adjacentVertices :: Vertex (MaybeT g) -> MaybeT g [Vertex (MaybeT g)] Source #
BidirectionalGraph g => AdjacencyListGraph (Dual g) Source #
Methods source :: Edge (Dual g) -> Dual g (Vertex (Dual g)) Source # target :: Edge (Dual g) -> Dual g (Vertex (Dual g)) Source # outEdges :: Vertex (Dual g) -> Dual g [Edge (Dual g)] Source # outDegree :: Vertex (Dual g) -> Dual g Int Source # adjacentVertices :: Vertex (Dual g) -> Dual g [Vertex (Dual g)] Source #
Ix i => AdjacencyListGraph (AdjacencyList i) Source #
Methods source :: Edge (AdjacencyList i) -> AdjacencyList i (Vertex (AdjacencyList i)) Source # target :: Edge (AdjacencyList i) -> AdjacencyList i (Vertex (AdjacencyList i)) Source # outEdges :: Vertex (AdjacencyList i) -> AdjacencyList i [Edge (AdjacencyList i)] Source # outDegree :: Vertex (AdjacencyList i) -> AdjacencyList i Int Source # adjacentVertices :: Vertex (AdjacencyList i) -> AdjacencyList i [Vertex (AdjacencyList i)] Source #
(AdjacencyListGraph g, Monoid m) => AdjacencyListGraph (WriterT m g) Source #
Methods source :: Edge (WriterT m g) -> WriterT m g (Vertex (WriterT m g)) Source # target :: Edge (WriterT m g) -> WriterT m g (Vertex (WriterT m g)) Source # outEdges :: Vertex (WriterT m g) -> WriterT m g [Edge (WriterT m g)] Source # outDegree :: Vertex (WriterT m g) -> WriterT m g Int Source # adjacentVertices :: Vertex (WriterT m g) -> WriterT m g [Vertex (WriterT m g)] Source #
(AdjacencyListGraph g, Monoid m) => AdjacencyListGraph (WriterT m g) Source #
Methods source :: Edge (WriterT m g) -> WriterT m g (Vertex (WriterT m g)) Source # target :: Edge (WriterT m g) -> WriterT m g (Vertex (WriterT m g)) Source # outEdges :: Vertex (WriterT m g) -> WriterT m g [Edge (WriterT m g)] Source # outDegree :: Vertex (WriterT m g) -> WriterT m g Int Source # adjacentVertices :: Vertex (WriterT m g) -> WriterT m g [Vertex (WriterT m g)] Source #
AdjacencyListGraph g => AdjacencyListGraph (StateT s g) Source #
Methods source :: Edge (StateT s g) -> StateT s g (Vertex (StateT s g)) Source # target :: Edge (StateT s g) -> StateT s g (Vertex (StateT s g)) Source # outEdges :: Vertex (StateT s g) -> StateT s g [Edge (StateT s g)] Source # outDegree :: Vertex (StateT s g) -> StateT s g Int Source # adjacentVertices :: Vertex (StateT s g) -> StateT s g [Vertex (StateT s g)] Source #
AdjacencyListGraph g => AdjacencyListGraph (StateT s g) Source #
Methods source :: Edge (StateT s g) -> StateT s g (Vertex (StateT s g)) Source # target :: Edge (StateT s g) -> StateT s g (Vertex (StateT s g)) Source # outEdges :: Vertex (StateT s g) -> StateT s g [Edge (StateT s g)] Source # outDegree :: Vertex (StateT s g) -> StateT s g Int Source # adjacentVertices :: Vertex (StateT s g) -> StateT s g [Vertex (StateT s g)] Source #
AdjacencyListGraph g => AdjacencyListGraph (IdentityT * g) Source #
Methods source :: Edge (IdentityT * g) -> IdentityT * g (Vertex (IdentityT * g)) Source # target :: Edge (IdentityT * g) -> IdentityT * g (Vertex (IdentityT * g)) Source # outEdges :: Vertex (IdentityT * g) -> IdentityT * g [Edge (IdentityT * g)] Source # outDegree :: Vertex (IdentityT * g) -> IdentityT * g Int Source # adjacentVertices :: Vertex (IdentityT * g) -> IdentityT * g [Vertex (IdentityT * g)] Source #
(AdjacencyListGraph g, Error e) => AdjacencyListGraph (ErrorT e g) Source #
Methods source :: Edge (ErrorT e g) -> ErrorT e g (Vertex (ErrorT e g)) Source # target :: Edge (ErrorT e g) -> ErrorT e g (Vertex (ErrorT e g)) Source # outEdges :: Vertex (ErrorT e g) -> ErrorT e g [Edge (ErrorT e g)] Source # outDegree :: Vertex (ErrorT e g) -> ErrorT e g Int Source # adjacentVertices :: Vertex (ErrorT e g) -> ErrorT e g [Vertex (ErrorT e g)] Source #
AdjacencyListGraph g => AdjacencyListGraph (ReaderT * e g) Source #
Methods source :: Edge (ReaderT * e g) -> ReaderT * e g (Vertex (ReaderT * e g)) Source # target :: Edge (ReaderT * e g) -> ReaderT * e g (Vertex (ReaderT * e g)) Source # outEdges :: Vertex (ReaderT * e g) -> ReaderT * e g [Edge (ReaderT * e g)] Source # outDegree :: Vertex (ReaderT * e g) -> ReaderT * e g Int Source # adjacentVertices :: Vertex (ReaderT * e g) -> ReaderT * e g [Vertex (ReaderT * e g)] Source #
(AdjacencyListGraph g, Monoid m) => AdjacencyListGraph (RWST r m s g) Source #
Methods source :: Edge (RWST r m s g) -> RWST r m s g (Vertex (RWST r m s g)) Source # target :: Edge (RWST r m s g) -> RWST r m s g (Vertex (RWST r m s g)) Source # outEdges :: Vertex (RWST r m s g) -> RWST r m s g [Edge (RWST r m s g)] Source # outDegree :: Vertex (RWST r m s g) -> RWST r m s g Int Source # adjacentVertices :: Vertex (RWST r m s g) -> RWST r m s g [Vertex (RWST r m s g)] Source #
(AdjacencyListGraph g, Monoid m) => AdjacencyListGraph (RWST r m s g) Source #
Methods source :: Edge (RWST r m s g) -> RWST r m s g (Vertex (RWST r m s g)) Source # target :: Edge (RWST r m s g) -> RWST r m s g (Vertex (RWST r m s g)) Source # outEdges :: Vertex (RWST r m s g) -> RWST r m s g [Edge (RWST r m s g)] Source # outDegree :: Vertex (RWST r m s g) -> RWST r m s g Int Source # adjacentVertices :: Vertex (RWST r m s g) -> RWST r m s g [Vertex (RWST r m s g)] Source #

defaultOutEdges :: AdjacencyListGraph g => Vertex g -> g [(Vertex g, Vertex g)] Source #

module Data.Graph.Class