Data.Graph.Class.AdjacencyList

Documentation

class Graph g => AdjacencyListGraph g where

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

Methods

source :: Edge g -> g (Vertex g)

target :: Edge g -> g (Vertex g)

outEdges :: Vertex g -> g [Edge g]

outDegree :: Vertex g -> g Int

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

Instances

AdjacencyListGraph Identity

(Graph (MaybeT g), AdjacencyListGraph g) => AdjacencyListGraph (MaybeT g)

(Graph (IdentityT g), AdjacencyListGraph g) => AdjacencyListGraph (IdentityT g)

(Graph (Dual g), BidirectionalGraph g) => AdjacencyListGraph (Dual g)

(Graph (AdjacencyList i), Ix i) => AdjacencyListGraph (AdjacencyList i)

(Graph (WriterT m g), AdjacencyListGraph g, Monoid m) => AdjacencyListGraph (WriterT m g)

(Graph (WriterT m g), AdjacencyListGraph g, Monoid m) => AdjacencyListGraph (WriterT m g)

(Graph (StateT s g), AdjacencyListGraph g) => AdjacencyListGraph (StateT s g)

(Graph (StateT s g), AdjacencyListGraph g) => AdjacencyListGraph (StateT s g)

(Graph (ReaderT e g), AdjacencyListGraph g) => AdjacencyListGraph (ReaderT e g)

(Graph (ErrorT e g), AdjacencyListGraph g, Error e) => AdjacencyListGraph (ErrorT e g)

(Graph (RWST r m s g), AdjacencyListGraph g, Monoid m) => AdjacencyListGraph (RWST r m s g)

(Graph (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)]

module Data.Graph.Class