Data.Graph.Haggle.SimpleBiDigraph

This is a simple graph (it does not allow parallel edges). To support this efficiently, it is less compact than Digraph or BiDigraph. As a consequence, edge existence tests are efficient (logarithmic in the number of edges leaving the source vertex).

Documentation

data MSimpleBiDigraph m

Instances

MBidirectional MSimpleBiDigraph

Defined in Data.Graph.Haggle.SimpleBiDigraph

Methods

getPredecessors :: (PrimMonad m, MonadRef m) => MSimpleBiDigraph m -> Vertex -> m [Vertex]

getInEdges :: (PrimMonad m, MonadRef m) => MSimpleBiDigraph m -> Vertex -> m [Edge]

MAddEdge MSimpleBiDigraph

Defined in Data.Graph.Haggle.SimpleBiDigraph

Methods

addEdge :: (PrimMonad m, MonadRef m) => MSimpleBiDigraph m -> Vertex -> Vertex -> m (Maybe Edge)

MAddVertex MSimpleBiDigraph

Defined in Data.Graph.Haggle.SimpleBiDigraph

Methods

addVertex :: (PrimMonad m, MonadRef m) => MSimpleBiDigraph m -> m Vertex

MGraph MSimpleBiDigraph

Defined in Data.Graph.Haggle.SimpleBiDigraph

Associated Types

type ImmutableGraph MSimpleBiDigraph

Methods

getVertices :: (PrimMonad m, MonadRef m) => MSimpleBiDigraph m -> m [Vertex]

getSuccessors :: (PrimMonad m, MonadRef m) => MSimpleBiDigraph m -> Vertex -> m [Vertex]

getOutEdges :: (PrimMonad m, MonadRef m) => MSimpleBiDigraph m -> Vertex -> m [Edge]

countVertices :: (PrimMonad m, MonadRef m) => MSimpleBiDigraph m -> m Int

countEdges :: (PrimMonad m, MonadRef m) => MSimpleBiDigraph m -> m Int

checkEdgeExists :: (PrimMonad m, MonadRef m) => MSimpleBiDigraph m -> Vertex -> Vertex -> m Bool

freeze :: (PrimMonad m, MonadRef m) => MSimpleBiDigraph m -> m (ImmutableGraph MSimpleBiDigraph)

type ImmutableGraph MSimpleBiDigraph

Defined in Data.Graph.Haggle.SimpleBiDigraph

type ImmutableGraph MSimpleBiDigraph = SimpleBiDigraph

data SimpleBiDigraph

Instances

NFData SimpleBiDigraph

Defined in Data.Graph.Haggle.SimpleBiDigraph

Methods

rnf :: SimpleBiDigraph -> ()

Bidirectional SimpleBiDigraph

Defined in Data.Graph.Haggle.SimpleBiDigraph

Methods

predecessors :: SimpleBiDigraph -> Vertex -> [Vertex]

inEdges :: SimpleBiDigraph -> Vertex -> [Edge]

Thawable SimpleBiDigraph

Defined in Data.Graph.Haggle.SimpleBiDigraph

Associated Types

type MutableGraph SimpleBiDigraph :: (Type -> Type) -> Type

Methods

thaw :: (PrimMonad m, MonadRef m) => SimpleBiDigraph -> m (MutableGraph SimpleBiDigraph m)

Graph SimpleBiDigraph

Defined in Data.Graph.Haggle.SimpleBiDigraph

Methods

vertices :: SimpleBiDigraph -> [Vertex]

edges :: SimpleBiDigraph -> [Edge]

successors :: SimpleBiDigraph -> Vertex -> [Vertex]

outEdges :: SimpleBiDigraph -> Vertex -> [Edge]

maxVertexId :: SimpleBiDigraph -> Int

isEmpty :: SimpleBiDigraph -> Bool

edgesBetween :: SimpleBiDigraph -> Vertex -> Vertex -> [Edge]

type MutableGraph SimpleBiDigraph

Defined in Data.Graph.Haggle.SimpleBiDigraph

type MutableGraph SimpleBiDigraph = MSimpleBiDigraph

newMSimpleBiDigraph :: (PrimMonad m, MonadRef m) => m (MSimpleBiDigraph m)

newSizedMSimpleBiDigraph :: (PrimMonad m, MonadRef m) => Int -> Int -> m (MSimpleBiDigraph m)