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.EdgeEnumerable

Description

 

Documentation

class Graph g => EdgeEnumerableGraph g where Source #

Minimal complete definition

edges

Methods

edges :: g [Edge g] Source #

O(e)

Instances

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

Methods

edges :: MaybeT g [Edge (MaybeT g)] Source #

EdgeEnumerableGraph g => EdgeEnumerableGraph (Dual g) Source # 

Methods

edges :: Dual g [Edge (Dual g)] Source #

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

Methods

edges :: WriterT m g [Edge (WriterT m g)] Source #

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

Methods

edges :: WriterT m g [Edge (WriterT m g)] Source #

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

Methods

edges :: StateT s g [Edge (StateT s g)] Source #

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

Methods

edges :: StateT s g [Edge (StateT s g)] Source #

EdgeEnumerableGraph g => EdgeEnumerableGraph (IdentityT * g) Source # 

Methods

edges :: IdentityT * g [Edge (IdentityT * g)] Source #

(EdgeEnumerableGraph g, Error e) => EdgeEnumerableGraph (ErrorT e g) Source # 

Methods

edges :: ErrorT e g [Edge (ErrorT e g)] Source #

EdgeEnumerableGraph g => EdgeEnumerableGraph (ReaderT * e g) Source # 

Methods

edges :: ReaderT * e g [Edge (ReaderT * e g)] Source #

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

Methods

edges :: RWST r m s g [Edge (RWST r m s g)] Source #

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

Methods

edges :: RWST r m s g [Edge (RWST r m s g)] Source #