| 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 | Haskell98 |
Data.Graph.Class.Bidirectional
Description
Documentation
class AdjacencyListGraph g => BidirectionalGraph g where Source
Minimal complete definition
Methods
inEdges :: Vertex g -> g [Edge g] Source
inDegree :: Vertex g -> g Int Source
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) |