Data.Graph.Haggle.VertexLabelAdapter

An adapter to create graphs with labeled vertices and unlabeled edges.

See LabeledGraph for an overview. The only significant difference is that this graph only supports adding unlabeled edges, and thus you must use addEdge instead of addLabeledEdge.

Documentation

data VertexLabeledMGraph g nl m

Instances

MBidirectional g => MBidirectional (VertexLabeledMGraph g nl)

Defined in Data.Graph.Haggle.VertexLabelAdapter

Methods

getPredecessors :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> Vertex -> m [Vertex]

getInEdges :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> Vertex -> m [Edge]

MAddVertex g => MLabeledVertex (VertexLabeledMGraph g nl)

Defined in Data.Graph.Haggle.VertexLabelAdapter

Associated Types

type MVertexLabel (VertexLabeledMGraph g nl) :: Type

Methods

getVertexLabel :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> Vertex -> m (Maybe (MVertexLabel (VertexLabeledMGraph g nl)))

addLabeledVertex :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> MVertexLabel (VertexLabeledMGraph g nl) -> m Vertex

getLabeledVertices :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> m [(Vertex, MVertexLabel (VertexLabeledMGraph g nl))]

MAddEdge g => MAddEdge (VertexLabeledMGraph g nl)

Defined in Data.Graph.Haggle.VertexLabelAdapter

Methods

addEdge :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> Vertex -> Vertex -> m (Maybe Edge)

MGraph g => MGraph (VertexLabeledMGraph g nl)

Defined in Data.Graph.Haggle.VertexLabelAdapter

Associated Types

type ImmutableGraph (VertexLabeledMGraph g nl) :: Type

Methods

getVertices :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> m [Vertex]

getSuccessors :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> Vertex -> m [Vertex]

getOutEdges :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> Vertex -> m [Edge]

countVertices :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> m Int

countEdges :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> m Int

checkEdgeExists :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> Vertex -> Vertex -> m Bool

freeze :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> m (ImmutableGraph (VertexLabeledMGraph g nl))

type MVertexLabel (VertexLabeledMGraph g nl)

Defined in Data.Graph.Haggle.VertexLabelAdapter

type MVertexLabel (VertexLabeledMGraph g nl) = nl

type ImmutableGraph (VertexLabeledMGraph g nl)

Defined in Data.Graph.Haggle.VertexLabelAdapter

type ImmutableGraph (VertexLabeledMGraph g nl) = VertexLabeledGraph (ImmutableGraph g) nl

data VertexLabeledGraph g nl

Instances

(NFData g, NFData nl) => NFData (VertexLabeledGraph g nl)

Defined in Data.Graph.Haggle.VertexLabelAdapter

Methods

rnf :: VertexLabeledGraph g nl -> ()

Graph g => HasVertexLabel (VertexLabeledGraph g nl)

Defined in Data.Graph.Haggle.VertexLabelAdapter

Associated Types

type VertexLabel (VertexLabeledGraph g nl) :: Type

Methods

vertexLabel :: VertexLabeledGraph g nl -> Vertex -> Maybe (VertexLabel (VertexLabeledGraph g nl))

labeledVertices :: VertexLabeledGraph g nl -> [(Vertex, VertexLabel (VertexLabeledGraph g nl))]

Bidirectional g => Bidirectional (VertexLabeledGraph g nl)

Defined in Data.Graph.Haggle.VertexLabelAdapter

Methods

predecessors :: VertexLabeledGraph g nl -> Vertex -> [Vertex]

inEdges :: VertexLabeledGraph g nl -> Vertex -> [Edge]

Thawable g => Thawable (VertexLabeledGraph g nl)

Defined in Data.Graph.Haggle.VertexLabelAdapter

Associated Types

type MutableGraph (VertexLabeledGraph g nl) :: (Type -> Type) -> Type

Methods

thaw :: (PrimMonad m, MonadRef m) => VertexLabeledGraph g nl -> m (MutableGraph (VertexLabeledGraph g nl) m)

Graph g => Graph (VertexLabeledGraph g nl)

Defined in Data.Graph.Haggle.VertexLabelAdapter

Methods

vertices :: VertexLabeledGraph g nl -> [Vertex]

edges :: VertexLabeledGraph g nl -> [Edge]

successors :: VertexLabeledGraph g nl -> Vertex -> [Vertex]

outEdges :: VertexLabeledGraph g nl -> Vertex -> [Edge]

maxVertexId :: VertexLabeledGraph g nl -> Int

isEmpty :: VertexLabeledGraph g nl -> Bool

edgesBetween :: VertexLabeledGraph g nl -> Vertex -> Vertex -> [Edge]

type VertexLabel (VertexLabeledGraph g nl)

Defined in Data.Graph.Haggle.VertexLabelAdapter

type VertexLabel (VertexLabeledGraph g nl) = nl

type MutableGraph (VertexLabeledGraph g nl)

Defined in Data.Graph.Haggle.VertexLabelAdapter

type MutableGraph (VertexLabeledGraph g nl) = VertexLabeledMGraph (MutableGraph g) nl

Mutable Graph API

newVertexLabeledGraph :: (MGraph g, PrimMonad m, MonadRef m) => m (g m) -> m (VertexLabeledMGraph g nl m)

newSizedVertexLabeledGraph :: (MGraph g, PrimMonad m, MonadRef m) => (Int -> Int -> m (g m)) -> Int -> Int -> m (VertexLabeledMGraph g nl m)

Immutable Graph API

mapVertexLabel :: VertexLabeledGraph g nl -> (nl -> nl') -> VertexLabeledGraph g nl'

fromEdgeList :: (MGraph g, MAddEdge g, MAddVertex g, Ord nl) => (forall s. ST s (g (ST s))) -> [(nl, nl)] -> (VertexLabeledGraph (ImmutableGraph g) nl, VertexMap nl)

Build a new (immutable) graph from a list of edges. Edges are defined by pairs of node labels. A new Vertex will be allocated for each node label.

The type of the constructed graph is controlled by the first argument, which is a constructor for a mutable graph.

Example:

import Data.Graph.Haggle.VertexLabelAdapter
import Data.Graph.Haggle.SimpleBiDigraph

let g = fromEdgeList newMSimpleBiDigraph [(0,1), (1,2), (2,3), (3,0)]

g has type SimpleBiDigraph.

An alternative that is fully polymorphic in the return type would be possible, but it would require type annotations on the result of fromEdgeList, which could be very annoying.