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 |
Language | Haskell98 |
Documentation
class AdjacencyListGraph g => BidirectionalGraph g where Source #
inEdges :: Vertex g -> g [Edge g] Source #
inDegree :: Vertex g -> g Int Source #
incidentEdges :: Vertex g -> g [Edge g] Source #
BidirectionalGraph Identity Source # | |
BidirectionalGraph g => BidirectionalGraph (MaybeT g) Source # | |
BidirectionalGraph g => BidirectionalGraph (Dual g) Source # | |
(BidirectionalGraph g, Monoid m) => BidirectionalGraph (WriterT m g) Source # | |
(BidirectionalGraph g, Monoid m) => BidirectionalGraph (WriterT m g) Source # | |
BidirectionalGraph g => BidirectionalGraph (StateT s g) Source # | |
BidirectionalGraph g => BidirectionalGraph (StateT s g) Source # | |
BidirectionalGraph g => BidirectionalGraph (IdentityT * g) Source # | |
(BidirectionalGraph g, Error e) => BidirectionalGraph (ErrorT e g) Source # | |
BidirectionalGraph g => BidirectionalGraph (ReaderT * e g) Source # | |
(BidirectionalGraph g, Monoid m) => BidirectionalGraph (RWST r m s g) Source # | |
(BidirectionalGraph g, Monoid m) => BidirectionalGraph (RWST r m s g) Source # | |