graphs-0.7.1: A simple monadic graph library

Copyright(C) 2011 Edward Kmett
LicenseBSD-style (see the file LICENSE)
MaintainerEdward Kmett <ekmett@gmail.com>
Stabilityexperimental
Portabilitytype families
Safe HaskellSafe
LanguageHaskell98

Data.Graph.Class.VertexEnumerable

Description

 

Documentation

class Graph g => VertexEnumerableGraph g where Source #

Minimal complete definition

vertices

Methods

vertices :: g [Vertex g] Source #

O(v)

Instances

VertexEnumerableGraph Identity Source # 
VertexEnumerableGraph g => VertexEnumerableGraph (MaybeT g) Source # 

Methods

vertices :: MaybeT g [Vertex (MaybeT g)] Source #

VertexEnumerableGraph g => VertexEnumerableGraph (Dual g) Source # 

Methods

vertices :: Dual g [Vertex (Dual g)] Source #

(VertexEnumerableGraph g, Monoid m) => VertexEnumerableGraph (WriterT m g) Source # 

Methods

vertices :: WriterT m g [Vertex (WriterT m g)] Source #

(VertexEnumerableGraph g, Monoid m) => VertexEnumerableGraph (WriterT m g) Source # 

Methods

vertices :: WriterT m g [Vertex (WriterT m g)] Source #

VertexEnumerableGraph g => VertexEnumerableGraph (StateT s g) Source # 

Methods

vertices :: StateT s g [Vertex (StateT s g)] Source #

VertexEnumerableGraph g => VertexEnumerableGraph (StateT s g) Source # 

Methods

vertices :: StateT s g [Vertex (StateT s g)] Source #

VertexEnumerableGraph g => VertexEnumerableGraph (IdentityT * g) Source # 
(VertexEnumerableGraph g, Error e) => VertexEnumerableGraph (ErrorT e g) Source # 

Methods

vertices :: ErrorT e g [Vertex (ErrorT e g)] Source #

VertexEnumerableGraph g => VertexEnumerableGraph (ReaderT * m g) Source # 

Methods

vertices :: ReaderT * m g [Vertex (ReaderT * m g)] Source #

(VertexEnumerableGraph g, Monoid m) => VertexEnumerableGraph (RWST r m s g) Source # 

Methods

vertices :: RWST r m s g [Vertex (RWST r m s g)] Source #

(VertexEnumerableGraph g, Monoid m) => VertexEnumerableGraph (RWST r m s g) Source # 

Methods

vertices :: RWST r m s g [Vertex (RWST r m s g)] Source #