Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Graph.Haggle.EdgeLabelAdapter

Description

This adapter adds edge labels (but not vertex labels) to graphs.

It only supports addLabeledEdge, not addEdge. See LabeledGraph for more details.

Documentation

data EdgeLabeledMGraph g el s Source #

Instances

Instances details

MAddVertex g => MAddVertex (EdgeLabeledMGraph g el) Source #
Instance details Defined in Data.Graph.Haggle.EdgeLabelAdapter Methods addVertex :: (PrimMonad m, MonadRef m) => EdgeLabeledMGraph g el m -> m Vertex Source #
MBidirectional g => MBidirectional (EdgeLabeledMGraph g el) Source #
Instance details Defined in Data.Graph.Haggle.EdgeLabelAdapter Methods getPredecessors :: (PrimMonad m, MonadRef m) => EdgeLabeledMGraph g el m -> Vertex -> m [Vertex] Source # getInEdges :: (PrimMonad m, MonadRef m) => EdgeLabeledMGraph g el m -> Vertex -> m [Edge] Source #
MGraph g => MGraph (EdgeLabeledMGraph g el) Source #
Instance details Defined in Data.Graph.Haggle.EdgeLabelAdapter Associated Types type ImmutableGraph (EdgeLabeledMGraph g el) Source # Methods getVertices :: (PrimMonad m, MonadRef m) => EdgeLabeledMGraph g el m -> m [Vertex] Source # getSuccessors :: (PrimMonad m, MonadRef m) => EdgeLabeledMGraph g el m -> Vertex -> m [Vertex] Source # getOutEdges :: (PrimMonad m, MonadRef m) => EdgeLabeledMGraph g el m -> Vertex -> m [Edge] Source # countVertices :: (PrimMonad m, MonadRef m) => EdgeLabeledMGraph g el m -> m Int Source # countEdges :: (PrimMonad m, MonadRef m) => EdgeLabeledMGraph g el m -> m Int Source # checkEdgeExists :: (PrimMonad m, MonadRef m) => EdgeLabeledMGraph g el m -> Vertex -> Vertex -> m Bool Source # freeze :: (PrimMonad m, MonadRef m) => EdgeLabeledMGraph g el m -> m (ImmutableGraph (EdgeLabeledMGraph g el)) Source #
MAddEdge g => MLabeledEdge (EdgeLabeledMGraph g el) Source #
Instance details Defined in Data.Graph.Haggle.EdgeLabelAdapter Associated Types type MEdgeLabel (EdgeLabeledMGraph g el) Source # Methods getEdgeLabel :: (PrimMonad m, MonadRef m) => EdgeLabeledMGraph g el m -> Edge -> m (Maybe (MEdgeLabel (EdgeLabeledMGraph g el))) Source # unsafeGetEdgeLabel :: (PrimMonad m, MonadRef m) => EdgeLabeledMGraph g el m -> Edge -> m (MEdgeLabel (EdgeLabeledMGraph g el)) Source # addLabeledEdge :: (PrimMonad m, MonadRef m) => EdgeLabeledMGraph g el m -> Vertex -> Vertex -> MEdgeLabel (EdgeLabeledMGraph g el) -> m (Maybe Edge) Source #
type ImmutableGraph (EdgeLabeledMGraph g el) Source #
Instance details Defined in Data.Graph.Haggle.EdgeLabelAdapter type ImmutableGraph (EdgeLabeledMGraph g el) = EdgeLabeledGraph (ImmutableGraph g) el
type MEdgeLabel (EdgeLabeledMGraph g el) Source #
Instance details Defined in Data.Graph.Haggle.EdgeLabelAdapter type MEdgeLabel (EdgeLabeledMGraph g el) = el

data EdgeLabeledGraph g el Source #

Instances

Instances details

(NFData g, NFData el) => NFData (EdgeLabeledGraph g el) Source #
Instance details Defined in Data.Graph.Haggle.EdgeLabelAdapter Methods rnf :: EdgeLabeledGraph g el -> () #
Bidirectional g => Bidirectional (EdgeLabeledGraph g el) Source #
Instance details Defined in Data.Graph.Haggle.EdgeLabelAdapter Methods predecessors :: EdgeLabeledGraph g el -> Vertex -> [Vertex] Source # inEdges :: EdgeLabeledGraph g el -> Vertex -> [Edge] Source #
Bidirectional g => BidirectionalEdgeLabel (EdgeLabeledGraph g el) Source #
Instance details Defined in Data.Graph.Haggle.EdgeLabelAdapter Methods labeledInEdges :: EdgeLabeledGraph g el -> Vertex -> [(Edge, EdgeLabel (EdgeLabeledGraph g el))] Source #
Graph g => Graph (EdgeLabeledGraph g el) Source #
Instance details Defined in Data.Graph.Haggle.EdgeLabelAdapter Methods vertices :: EdgeLabeledGraph g el -> [Vertex] Source # edges :: EdgeLabeledGraph g el -> [Edge] Source # successors :: EdgeLabeledGraph g el -> Vertex -> [Vertex] Source # outEdges :: EdgeLabeledGraph g el -> Vertex -> [Edge] Source # maxVertexId :: EdgeLabeledGraph g el -> Int Source # isEmpty :: EdgeLabeledGraph g el -> Bool Source # edgesBetween :: EdgeLabeledGraph g el -> Vertex -> Vertex -> [Edge] Source #
Graph g => HasEdgeLabel (EdgeLabeledGraph g el) Source #
Instance details Defined in Data.Graph.Haggle.EdgeLabelAdapter Associated Types type EdgeLabel (EdgeLabeledGraph g el) Source # Methods edgeLabel :: EdgeLabeledGraph g el -> Edge -> Maybe (EdgeLabel (EdgeLabeledGraph g el)) Source # labeledEdges :: EdgeLabeledGraph g el -> [(Edge, EdgeLabel (EdgeLabeledGraph g el))] Source # labeledOutEdges :: EdgeLabeledGraph g el -> Vertex -> [(Edge, EdgeLabel (EdgeLabeledGraph g el))] Source #
Thawable g => Thawable (EdgeLabeledGraph g el) Source #
Instance details Defined in Data.Graph.Haggle.EdgeLabelAdapter Associated Types type MutableGraph (EdgeLabeledGraph g el) :: (Type -> Type) -> Type Source # Methods thaw :: (PrimMonad m, MonadRef m) => EdgeLabeledGraph g el -> m (MutableGraph (EdgeLabeledGraph g el) m) Source #
type EdgeLabel (EdgeLabeledGraph g el) Source #
Instance details Defined in Data.Graph.Haggle.EdgeLabelAdapter type EdgeLabel (EdgeLabeledGraph g el) = el
type MutableGraph (EdgeLabeledGraph g el) Source #
Instance details Defined in Data.Graph.Haggle.EdgeLabelAdapter type MutableGraph (EdgeLabeledGraph g el) = EdgeLabeledMGraph (MutableGraph g) el

newEdgeLabeledGraph :: (MGraph g, PrimMonad m, MonadRef m) => m (g m) -> m (EdgeLabeledMGraph g nl m) Source #

newSizedEdgeLabeledGraph :: (MGraph g, PrimMonad m, MonadRef m) => (Int -> Int -> m (g m)) -> Int -> Int -> m (EdgeLabeledMGraph g el m) Source #

mapEdgeLabel :: EdgeLabeledGraph g el -> (el -> el') -> EdgeLabeledGraph g el' Source #