Data.Graph.Dual

Documentation

newtype Dual g a

Constructors

Dual

Fields

• runDual :: g a

Instances

MonadTrans Dual

Defined in Data.Graph.Dual

Methods

lift :: Monad m => m a -> Dual m a

Monad g => Monad (Dual g)

Defined in Data.Graph.Dual

Methods

(>>=) :: Dual g a -> (a -> Dual g b) -> Dual g b

(>>) :: Dual g a -> Dual g b -> Dual g b

return :: a -> Dual g a

Functor g => Functor (Dual g)

Defined in Data.Graph.Dual

Methods

fmap :: (a -> b) -> Dual g a -> Dual g b

(<$) :: a -> Dual g b -> Dual g a

Applicative g => Applicative (Dual g)

Defined in Data.Graph.Dual

Methods

pure :: a -> Dual g a

(<*>) :: Dual g (a -> b) -> Dual g a -> Dual g b

liftA2 :: (a -> b -> c) -> Dual g a -> Dual g b -> Dual g c

(*>) :: Dual g a -> Dual g b -> Dual g b

(<*) :: Dual g a -> Dual g b -> Dual g a

Graph g => Graph (Dual g)

Defined in Data.Graph.Dual

Associated Types

type Vertex (Dual g)

type Edge (Dual g)

Methods

vertexMap :: a -> Dual g (VertexMap (Dual g) a)

edgeMap :: a -> Dual g (EdgeMap (Dual g) a)

VertexEnumerableGraph g => VertexEnumerableGraph (Dual g)

Defined in Data.Graph.Dual

Methods

vertices :: Dual g [Vertex (Dual g)]

EdgeEnumerableGraph g => EdgeEnumerableGraph (Dual g)

Defined in Data.Graph.Dual

Methods

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

AdjacencyMatrixGraph g => AdjacencyMatrixGraph (Dual g)

Defined in Data.Graph.Dual

Methods

edge :: Vertex (Dual g) -> Vertex (Dual g) -> Dual g (Maybe (Edge (Dual g)))

BidirectionalGraph g => AdjacencyListGraph (Dual g)

Defined in Data.Graph.Dual

Methods

source :: Edge (Dual g) -> Dual g (Vertex (Dual g))

target :: Edge (Dual g) -> Dual g (Vertex (Dual g))

outEdges :: Vertex (Dual g) -> Dual g [Edge (Dual g)]

outDegree :: Vertex (Dual g) -> Dual g Int

adjacentVertices :: Vertex (Dual g) -> Dual g [Vertex (Dual g)]

BidirectionalGraph g => BidirectionalGraph (Dual g)

Defined in Data.Graph.Dual

Methods

inEdges :: Vertex (Dual g) -> Dual g [Edge (Dual g)]

inDegree :: Vertex (Dual g) -> Dual g Int

incidentEdges :: Vertex (Dual g) -> Dual g [Edge (Dual g)]

degree :: Vertex (Dual g) -> Dual g Int

type Vertex (Dual g)

Defined in Data.Graph.Dual

type Vertex (Dual g) = Vertex g

type Edge (Dual g)

Defined in Data.Graph.Dual

type Edge (Dual g) = Edge g