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

Data.Graph.Class.Bidirectional

Description

Documentation

class AdjacencyListGraph g => BidirectionalGraph g where Source #

Minimal complete definition

inEdges

Methods

inEdges :: Vertex g -> g [Edge g] Source #

inDegree :: Vertex g -> g Int Source #

incidentEdges :: Vertex g -> g [Edge g] Source #

degree :: Vertex g -> g Int Source #

Instances

Instances details

BidirectionalGraph Identity Source #
Instance details Defined in Data.Graph.Class.Bidirectional Methods inEdges :: Vertex Identity -> Identity [Edge Identity] Source # inDegree :: Vertex Identity -> Identity Int Source # incidentEdges :: Vertex Identity -> Identity [Edge Identity] Source # degree :: Vertex Identity -> Identity Int Source #
BidirectionalGraph g => BidirectionalGraph (MaybeT g) Source #
Instance details Defined in Data.Graph.Class.Bidirectional Methods inEdges :: Vertex (MaybeT g) -> MaybeT g [Edge (MaybeT g)] Source # inDegree :: Vertex (MaybeT g) -> MaybeT g Int Source # incidentEdges :: Vertex (MaybeT g) -> MaybeT g [Edge (MaybeT g)] Source # degree :: Vertex (MaybeT g) -> MaybeT g Int Source #
BidirectionalGraph g => BidirectionalGraph (Dual g) Source #
Instance details Defined in Data.Graph.Dual Methods inEdges :: Vertex (Dual g) -> Dual g [Edge (Dual g)] Source # inDegree :: Vertex (Dual g) -> Dual g Int Source # incidentEdges :: Vertex (Dual g) -> Dual g [Edge (Dual g)] Source # degree :: Vertex (Dual g) -> Dual g Int Source #
(BidirectionalGraph g, Monoid m) => BidirectionalGraph (WriterT m g) Source #
Instance details Defined in Data.Graph.Class.Bidirectional Methods inEdges :: Vertex (WriterT m g) -> WriterT m g [Edge (WriterT m g)] Source # inDegree :: Vertex (WriterT m g) -> WriterT m g Int Source # incidentEdges :: Vertex (WriterT m g) -> WriterT m g [Edge (WriterT m g)] Source # degree :: Vertex (WriterT m g) -> WriterT m g Int Source #
(BidirectionalGraph g, Monoid m) => BidirectionalGraph (WriterT m g) Source #
Instance details Defined in Data.Graph.Class.Bidirectional Methods inEdges :: Vertex (WriterT m g) -> WriterT m g [Edge (WriterT m g)] Source # inDegree :: Vertex (WriterT m g) -> WriterT m g Int Source # incidentEdges :: Vertex (WriterT m g) -> WriterT m g [Edge (WriterT m g)] Source # degree :: Vertex (WriterT m g) -> WriterT m g Int Source #
BidirectionalGraph g => BidirectionalGraph (StateT s g) Source #
Instance details Defined in Data.Graph.Class.Bidirectional Methods inEdges :: Vertex (StateT s g) -> StateT s g [Edge (StateT s g)] Source # inDegree :: Vertex (StateT s g) -> StateT s g Int Source # incidentEdges :: Vertex (StateT s g) -> StateT s g [Edge (StateT s g)] Source # degree :: Vertex (StateT s g) -> StateT s g Int Source #
BidirectionalGraph g => BidirectionalGraph (StateT s g) Source #
Instance details Defined in Data.Graph.Class.Bidirectional Methods inEdges :: Vertex (StateT s g) -> StateT s g [Edge (StateT s g)] Source # inDegree :: Vertex (StateT s g) -> StateT s g Int Source # incidentEdges :: Vertex (StateT s g) -> StateT s g [Edge (StateT s g)] Source # degree :: Vertex (StateT s g) -> StateT s g Int Source #
BidirectionalGraph g => BidirectionalGraph (ReaderT e g) Source #
Instance details Defined in Data.Graph.Class.Bidirectional Methods inEdges :: Vertex (ReaderT e g) -> ReaderT e g [Edge (ReaderT e g)] Source # inDegree :: Vertex (ReaderT e g) -> ReaderT e g Int Source # incidentEdges :: Vertex (ReaderT e g) -> ReaderT e g [Edge (ReaderT e g)] Source # degree :: Vertex (ReaderT e g) -> ReaderT e g Int Source #
BidirectionalGraph g => BidirectionalGraph (IdentityT g) Source #
Instance details Defined in Data.Graph.Class.Bidirectional Methods inEdges :: Vertex (IdentityT g) -> IdentityT g [Edge (IdentityT g)] Source # inDegree :: Vertex (IdentityT g) -> IdentityT g Int Source # incidentEdges :: Vertex (IdentityT g) -> IdentityT g [Edge (IdentityT g)] Source # degree :: Vertex (IdentityT g) -> IdentityT g Int Source #
(BidirectionalGraph g, Error e) => BidirectionalGraph (ErrorT e g) Source #
Instance details Defined in Data.Graph.Class.Bidirectional Methods inEdges :: Vertex (ErrorT e g) -> ErrorT e g [Edge (ErrorT e g)] Source # inDegree :: Vertex (ErrorT e g) -> ErrorT e g Int Source # incidentEdges :: Vertex (ErrorT e g) -> ErrorT e g [Edge (ErrorT e g)] Source # degree :: Vertex (ErrorT e g) -> ErrorT e g Int Source #
(BidirectionalGraph g, Monoid m) => BidirectionalGraph (RWST r m s g) Source #
Instance details Defined in Data.Graph.Class.Bidirectional Methods inEdges :: Vertex (RWST r m s g) -> RWST r m s g [Edge (RWST r m s g)] Source # inDegree :: Vertex (RWST r m s g) -> RWST r m s g Int Source # incidentEdges :: Vertex (RWST r m s g) -> RWST r m s g [Edge (RWST r m s g)] Source # degree :: Vertex (RWST r m s g) -> RWST r m s g Int Source #
(BidirectionalGraph g, Monoid m) => BidirectionalGraph (RWST r m s g) Source #
Instance details Defined in Data.Graph.Class.Bidirectional Methods inEdges :: Vertex (RWST r m s g) -> RWST r m s g [Edge (RWST r m s g)] Source # inDegree :: Vertex (RWST r m s g) -> RWST r m s g Int Source # incidentEdges :: Vertex (RWST r m s g) -> RWST r m s g [Edge (RWST r m s g)] Source # degree :: Vertex (RWST r m s g) -> RWST r m s g Int Source #

module Data.Graph.Class.AdjacencyList