Safe Haskell	None
Language	Haskell2010

Data.Graph.Haggle.BiDigraph

Description

This graph is an efficient representation of bidirectional graphs with parallel edges.

This is in contrast to SimpleBiDigraph, which can only handle simple graphs (i.e., without parallel edges).

The representation is slightly less efficient as a result.

Synopsis

data MBiDigraph m
data BiDigraph
newMBiDigraph :: (PrimMonad m, MonadRef m) => m (MBiDigraph m)
newSizedMBiDigraph :: (PrimMonad m, MonadRef m) => Int -> Int -> m (MBiDigraph m)

Documentation

data MBiDigraph m Source #

A mutable bidirectional graph

Instances

MBidirectional MBiDigraph Source #
Instance details Defined in Data.Graph.Haggle.BiDigraph Methods getPredecessors :: (PrimMonad m, MonadRef m) => MBiDigraph m -> Vertex -> m [Vertex] Source # getInEdges :: (PrimMonad m, MonadRef m) => MBiDigraph m -> Vertex -> m [Edge] Source #
MAddEdge MBiDigraph Source #
Instance details Defined in Data.Graph.Haggle.BiDigraph Methods addEdge :: (PrimMonad m, MonadRef m) => MBiDigraph m -> Vertex -> Vertex -> m (Maybe Edge) Source #
MAddVertex MBiDigraph Source #
Instance details Defined in Data.Graph.Haggle.BiDigraph Methods addVertex :: (PrimMonad m, MonadRef m) => MBiDigraph m -> m Vertex Source #
MGraph MBiDigraph Source #
Instance details Defined in Data.Graph.Haggle.BiDigraph Associated Types type ImmutableGraph MBiDigraph :: Type Source # Methods getVertices :: (PrimMonad m, MonadRef m) => MBiDigraph m -> m [Vertex] Source # getSuccessors :: (PrimMonad m, MonadRef m) => MBiDigraph m -> Vertex -> m [Vertex] Source # getOutEdges :: (PrimMonad m, MonadRef m) => MBiDigraph m -> Vertex -> m [Edge] Source # countVertices :: (PrimMonad m, MonadRef m) => MBiDigraph m -> m Int Source # countEdges :: (PrimMonad m, MonadRef m) => MBiDigraph m -> m Int Source # checkEdgeExists :: (PrimMonad m, MonadRef m) => MBiDigraph m -> Vertex -> Vertex -> m Bool Source # freeze :: (PrimMonad m, MonadRef m) => MBiDigraph m -> m (ImmutableGraph MBiDigraph) Source #
type ImmutableGraph MBiDigraph Source #
Instance details Defined in Data.Graph.Haggle.BiDigraph type ImmutableGraph MBiDigraph = BiDigraph

data BiDigraph Source #

An immutable bidirectional graph

Instances

Bidirectional BiDigraph Source #
Instance details Defined in Data.Graph.Haggle.BiDigraph Methods predecessors :: BiDigraph -> Vertex -> [Vertex] Source # inEdges :: BiDigraph -> Vertex -> [Edge] Source #
Thawable BiDigraph Source #
Instance details Defined in Data.Graph.Haggle.BiDigraph Associated Types type MutableGraph BiDigraph :: (Type -> Type) -> Type Source # Methods thaw :: (PrimMonad m, MonadRef m) => BiDigraph -> m (MutableGraph BiDigraph m) Source #
Graph BiDigraph Source #
Instance details Defined in Data.Graph.Haggle.BiDigraph Methods vertices :: BiDigraph -> [Vertex] Source # edges :: BiDigraph -> [Edge] Source # successors :: BiDigraph -> Vertex -> [Vertex] Source # outEdges :: BiDigraph -> Vertex -> [Edge] Source # maxVertexId :: BiDigraph -> Int Source # isEmpty :: BiDigraph -> Bool Source # edgesBetween :: BiDigraph -> Vertex -> Vertex -> [Edge] Source #
type MutableGraph BiDigraph Source #
Instance details Defined in Data.Graph.Haggle.BiDigraph type MutableGraph BiDigraph = MBiDigraph

newMBiDigraph :: (PrimMonad m, MonadRef m) => m (MBiDigraph m) Source #

Allocate a new mutable bidirectional graph with a default size

newSizedMBiDigraph Source #

Arguments

:: (PrimMonad m, MonadRef m)
=> Int	Reserved space for nodes
-> Int	Reserved space for edges
-> m (MBiDigraph m)

Allocate a new mutable bidirectional graph with space reserved for nodes and edges. This can be more efficient and avoid resizing.