Safe Haskell	None
Language	Haskell2010

Data.Graph.Haggle.SimpleBiDigraph

Description

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 Source #

Instances

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

data SimpleBiDigraph Source #

Instances

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

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

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