| Portability | type families |
|---|---|
| Stability | experimental |
| Maintainer | Edward Kmett <ekmett@gmail.com> |
| Safe Haskell | Safe-Infered |
Data.Graph.Class.Bidirectional
Description
Documentation
class AdjacencyListGraph g => BidirectionalGraph g whereSource
Methods
inEdges :: Vertex g -> g [Edge g]Source
inDegree :: Vertex g -> g IntSource
incidentEdges :: Vertex g -> g [Edge g]Source
Instances
| BidirectionalGraph Identity | |
| BidirectionalGraph g => BidirectionalGraph (MaybeT g) | |
| BidirectionalGraph g => BidirectionalGraph (IdentityT g) | |
| BidirectionalGraph g => BidirectionalGraph (Dual g) | |
| (BidirectionalGraph g, Monoid m) => BidirectionalGraph (WriterT m g) | |
| (BidirectionalGraph g, Monoid m) => BidirectionalGraph (WriterT m g) | |
| BidirectionalGraph g => BidirectionalGraph (StateT s g) | |
| BidirectionalGraph g => BidirectionalGraph (StateT s g) | |
| BidirectionalGraph g => BidirectionalGraph (ReaderT e g) | |
| (BidirectionalGraph g, Error e) => BidirectionalGraph (ErrorT e g) | |
| (BidirectionalGraph g, Monoid m) => BidirectionalGraph (RWST r m s g) | |
| (BidirectionalGraph g, Monoid m) => BidirectionalGraph (RWST r m s g) |