Safe Haskell	None
Language	Haskell2010

Data.Graph.Haggle.Classes

Contents

Basic Types
Mutable Graphs
Immutable Graphs
Inductive Graphs

Synopsis

data Vertex
vertexId :: Vertex -> Int
data Edge
edgeSource :: Edge -> Vertex
edgeDest :: Edge -> Vertex
class MGraph g where
- type ImmutableGraph g
- getVertices :: (PrimMonad m, MonadRef m) => g m -> m [Vertex]
- getSuccessors :: (PrimMonad m, MonadRef m) => g m -> Vertex -> m [Vertex]
- getOutEdges :: (PrimMonad m, MonadRef m) => g m -> Vertex -> m [Edge]
- countVertices :: (PrimMonad m, MonadRef m) => g m -> m Int
- countEdges :: (PrimMonad m, MonadRef m) => g m -> m Int
- checkEdgeExists :: (PrimMonad m, MonadRef m) => g m -> Vertex -> Vertex -> m Bool
- freeze :: (PrimMonad m, MonadRef m) => g m -> m (ImmutableGraph g)
class MGraph g => MAddEdge g where
- addEdge :: (PrimMonad m, MonadRef m) => g m -> Vertex -> Vertex -> m (Maybe Edge)
class MGraph g => MAddVertex g where
- addVertex :: (PrimMonad m, MonadRef m) => g m -> m Vertex
class MGraph g => MRemovable g where
- removeVertex :: (PrimMonad m, MonadRef m) => g m -> Vertex -> m ()
- removeEdgesBetween :: (PrimMonad m, MonadRef m) => g m -> Vertex -> Vertex -> m ()
- removeEdge :: (PrimMonad m, MonadRef m) => g m -> Edge -> m ()
class MGraph g => MBidirectional g where
- getPredecessors :: (PrimMonad m, MonadRef m) => g m -> Vertex -> m [Vertex]
- getInEdges :: (PrimMonad m, MonadRef m) => g m -> Vertex -> m [Edge]
class MGraph g => MLabeledEdge g where
- type MEdgeLabel g
- getEdgeLabel :: (PrimMonad m, MonadRef m) => g m -> Edge -> m (Maybe (MEdgeLabel g))
- unsafeGetEdgeLabel :: (PrimMonad m, MonadRef m) => g m -> Edge -> m (MEdgeLabel g)
- addLabeledEdge :: (PrimMonad m, MonadRef m) => g m -> Vertex -> Vertex -> MEdgeLabel g -> m (Maybe Edge)
class MGraph g => MLabeledVertex g where
- type MVertexLabel g
- getVertexLabel :: (PrimMonad m, MonadRef m) => g m -> Vertex -> m (Maybe (MVertexLabel g))
- addLabeledVertex :: (PrimMonad m, MonadRef m) => g m -> MVertexLabel g -> m Vertex
- getLabeledVertices :: (PrimMonad m, MonadRef m) => g m -> m [(Vertex, MVertexLabel g)]
class Graph g where
- vertices :: g -> [Vertex]
- edges :: g -> [Edge]
- successors :: g -> Vertex -> [Vertex]
- outEdges :: g -> Vertex -> [Edge]
- maxVertexId :: g -> Int
- isEmpty :: g -> Bool
- edgesBetween :: g -> Vertex -> Vertex -> [Edge]
edgeExists :: Graph g => g -> Vertex -> Vertex -> Bool
class Graph g => Thawable g where
- type MutableGraph g :: (Type -> Type) -> Type
- thaw :: (PrimMonad m, MonadRef m) => g -> m (MutableGraph g m)
class Graph g => Bidirectional g where
- predecessors :: g -> Vertex -> [Vertex]
- inEdges :: g -> Vertex -> [Edge]
class Graph g => HasEdgeLabel g where
- type EdgeLabel g
- edgeLabel :: g -> Edge -> Maybe (EdgeLabel g)
- labeledEdges :: g -> [(Edge, EdgeLabel g)]
- labeledOutEdges :: g -> Vertex -> [(Edge, EdgeLabel g)]
class Graph g => HasVertexLabel g where
- type VertexLabel g
- vertexLabel :: g -> Vertex -> Maybe (VertexLabel g)
- labeledVertices :: g -> [(Vertex, VertexLabel g)]
class (HasEdgeLabel g, Bidirectional g) => BidirectionalEdgeLabel g where
- labeledInEdges :: g -> Vertex -> [(Edge, EdgeLabel g)]
class (Graph g, HasEdgeLabel g, HasVertexLabel g) => InductiveGraph g where
- emptyGraph :: g
- match :: g -> Vertex -> Maybe (Context g, g)
- context :: g -> Vertex -> Maybe (Context g)
- insertLabeledVertex :: g -> VertexLabel g -> (Vertex, g)
- insertLabeledEdge :: g -> Vertex -> Vertex -> EdgeLabel g -> Maybe (Edge, g)
- deleteEdge :: g -> Edge -> g
- deleteEdgesBetween :: g -> Vertex -> Vertex -> g
- replaceLabeledEdge :: g -> Vertex -> Vertex -> EdgeLabel g -> Maybe (Edge, g)
- deleteVertex :: g -> Vertex -> g
data Context g = Context [(EdgeLabel g, Vertex)] (VertexLabel g) [(EdgeLabel g, Vertex)]

Basic Types

data Vertex Source #

An abstract representation of a vertex.

Note that the representation is currently exposed. Do not rely on this, as it is subject to change.

Instances

Instances details

Eq Vertex Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic Methods (==) :: Vertex -> Vertex -> Bool # (/=) :: Vertex -> Vertex -> Bool #
Ord Vertex Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic Methods compare :: Vertex -> Vertex -> Ordering # (<) :: Vertex -> Vertex -> Bool # (<=) :: Vertex -> Vertex -> Bool # (>) :: Vertex -> Vertex -> Bool # (>=) :: Vertex -> Vertex -> Bool # max :: Vertex -> Vertex -> Vertex # min :: Vertex -> Vertex -> Vertex #
Show Vertex Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic Methods showsPrec :: Int -> Vertex -> ShowS # show :: Vertex -> String # showList :: [Vertex] -> ShowS #
NFData Vertex Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic Methods rnf :: Vertex -> () #
Hashable Vertex Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic Methods hashWithSalt :: Int -> Vertex -> Int # hash :: Vertex -> Int #
Unbox Vertex Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic
Vector Vector Vertex Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Vertex -> m (Vector Vertex) # basicUnsafeThaw :: PrimMonad m => Vector Vertex -> m (Mutable Vector (PrimState m) Vertex) # basicLength :: Vector Vertex -> Int # basicUnsafeSlice :: Int -> Int -> Vector Vertex -> Vector Vertex # basicUnsafeIndexM :: Monad m => Vector Vertex -> Int -> m Vertex # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Vertex -> Vector Vertex -> m () # elemseq :: Vector Vertex -> Vertex -> b -> b #
MVector MVector Vertex Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic Methods basicLength :: MVector s Vertex -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Vertex -> MVector s Vertex # basicOverlaps :: MVector s Vertex -> MVector s Vertex -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Vertex) # basicInitialize :: PrimMonad m => MVector (PrimState m) Vertex -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Vertex -> m (MVector (PrimState m) Vertex) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Vertex -> Int -> m Vertex # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Vertex -> Int -> Vertex -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Vertex -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Vertex -> Vertex -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Vertex -> MVector (PrimState m) Vertex -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Vertex -> MVector (PrimState m) Vertex -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Vertex -> Int -> m (MVector (PrimState m) Vertex) #
newtype Vector Vertex Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic newtype Vector Vertex = V_Vertex (Vector Int)
newtype MVector s Vertex Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic newtype MVector s Vertex = MV_Vertex (MVector s Int)

vertexId :: Vertex -> Int Source #

data Edge Source #

An edge between two vertices.

Instances

Instances details

Eq Edge Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic Methods (==) :: Edge -> Edge -> Bool # (/=) :: Edge -> Edge -> Bool #
Ord Edge Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic Methods compare :: Edge -> Edge -> Ordering # (<) :: Edge -> Edge -> Bool # (<=) :: Edge -> Edge -> Bool # (>) :: Edge -> Edge -> Bool # (>=) :: Edge -> Edge -> Bool # max :: Edge -> Edge -> Edge # min :: Edge -> Edge -> Edge #
Show Edge Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic Methods showsPrec :: Int -> Edge -> ShowS # show :: Edge -> String # showList :: [Edge] -> ShowS #
NFData Edge Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic Methods rnf :: Edge -> () #
Hashable Edge Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic Methods hashWithSalt :: Int -> Edge -> Int # hash :: Edge -> Int #
Unbox Edge Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic
Vector Vector Edge Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Edge -> m (Vector Edge) # basicUnsafeThaw :: PrimMonad m => Vector Edge -> m (Mutable Vector (PrimState m) Edge) # basicLength :: Vector Edge -> Int # basicUnsafeSlice :: Int -> Int -> Vector Edge -> Vector Edge # basicUnsafeIndexM :: Monad m => Vector Edge -> Int -> m Edge # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Edge -> Vector Edge -> m () # elemseq :: Vector Edge -> Edge -> b -> b #
MVector MVector Edge Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic Methods basicLength :: MVector s Edge -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Edge -> MVector s Edge # basicOverlaps :: MVector s Edge -> MVector s Edge -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Edge) # basicInitialize :: PrimMonad m => MVector (PrimState m) Edge -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Edge -> m (MVector (PrimState m) Edge) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Edge -> Int -> m Edge # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Edge -> Int -> Edge -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Edge -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Edge -> Edge -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Edge -> MVector (PrimState m) Edge -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Edge -> MVector (PrimState m) Edge -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Edge -> Int -> m (MVector (PrimState m) Edge) #
newtype Vector Edge Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic newtype Vector Edge = V_Edge (Vector (Int, Int, Int))
newtype MVector s Edge Source #
Instance details Defined in Data.Graph.Haggle.Internal.Basic newtype MVector s Edge = MV_Edge (MVector s (Int, Int, Int))

edgeSource :: Edge -> Vertex Source #

edgeDest :: Edge -> Vertex Source #

Mutable Graphs

class MGraph g where Source #

The interface supported by a mutable graph.

Minimal complete definition

getVertices, getSuccessors, getOutEdges, countVertices, countEdges, freeze

Associated Types

type ImmutableGraph g Source #

The type generated by freezeing a mutable graph

Methods

getVertices :: (PrimMonad m, MonadRef m) => g m -> m [Vertex] Source #

List all of the vertices in the graph.

getSuccessors :: (PrimMonad m, MonadRef m) => g m -> Vertex -> m [Vertex] Source #

List the successors for the given Vertex.

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

Get all of the Edges with the given Vertex as their source.

countVertices :: (PrimMonad m, MonadRef m) => g m -> m Int Source #

Return the number of vertices in the graph

countEdges :: (PrimMonad m, MonadRef m) => g m -> m Int Source #

Return the number of edges in the graph

checkEdgeExists :: (PrimMonad m, MonadRef m) => g m -> Vertex -> Vertex -> m Bool Source #

Edge existence test; this has a default implementation, but can be overridden if an implementation can support a better-than-linear version.

freeze :: (PrimMonad m, MonadRef m) => g m -> m (ImmutableGraph g) Source #

Freeze the mutable graph into an immutable graph.

Instances

Instances details

MGraph MDigraph Source #
Instance details Defined in Data.Graph.Haggle.Digraph Associated Types type ImmutableGraph MDigraph Source # Methods getVertices :: (PrimMonad m, MonadRef m) => MDigraph m -> m [Vertex] Source # getSuccessors :: (PrimMonad m, MonadRef m) => MDigraph m -> Vertex -> m [Vertex] Source # getOutEdges :: (PrimMonad m, MonadRef m) => MDigraph m -> Vertex -> m [Edge] Source # countVertices :: (PrimMonad m, MonadRef m) => MDigraph m -> m Int Source # countEdges :: (PrimMonad m, MonadRef m) => MDigraph m -> m Int Source # checkEdgeExists :: (PrimMonad m, MonadRef m) => MDigraph m -> Vertex -> Vertex -> m Bool Source # freeze :: (PrimMonad m, MonadRef m) => MDigraph m -> m (ImmutableGraph MDigraph) Source #
MGraph MBiDigraph Source #
Instance details Defined in Data.Graph.Haggle.BiDigraph Associated Types type ImmutableGraph MBiDigraph 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 #
MGraph MSimpleBiDigraph Source #
Instance details Defined in Data.Graph.Haggle.SimpleBiDigraph Associated Types type ImmutableGraph MSimpleBiDigraph 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 #
MGraph g => MGraph (VertexLabeledMGraph g nl) Source #
Instance details Defined in Data.Graph.Haggle.VertexLabelAdapter Associated Types type ImmutableGraph (VertexLabeledMGraph g nl) Source # Methods getVertices :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> m [Vertex] Source # getSuccessors :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> Vertex -> m [Vertex] Source # getOutEdges :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> Vertex -> m [Edge] Source # countVertices :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> m Int Source # countEdges :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> m Int Source # checkEdgeExists :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> Vertex -> Vertex -> m Bool Source # freeze :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> m (ImmutableGraph (VertexLabeledMGraph g nl)) 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 #
MGraph g => MGraph (LabeledMGraph g nl el) Source #
Instance details Defined in Data.Graph.Haggle.Internal.Adapter Associated Types type ImmutableGraph (LabeledMGraph g nl el) Source # Methods getVertices :: (PrimMonad m, MonadRef m) => LabeledMGraph g nl el m -> m [Vertex] Source # getSuccessors :: (PrimMonad m, MonadRef m) => LabeledMGraph g nl el m -> Vertex -> m [Vertex] Source # getOutEdges :: (PrimMonad m, MonadRef m) => LabeledMGraph g nl el m -> Vertex -> m [Edge] Source # countVertices :: (PrimMonad m, MonadRef m) => LabeledMGraph g nl el m -> m Int Source # countEdges :: (PrimMonad m, MonadRef m) => LabeledMGraph g nl el m -> m Int Source # checkEdgeExists :: (PrimMonad m, MonadRef m) => LabeledMGraph g nl el m -> Vertex -> Vertex -> m Bool Source # freeze :: (PrimMonad m, MonadRef m) => LabeledMGraph g nl el m -> m (ImmutableGraph (LabeledMGraph g nl el)) Source #

class MGraph g => MAddEdge g where Source #

Methods

addEdge :: (PrimMonad m, MonadRef m) => g m -> Vertex -> Vertex -> m (Maybe Edge) Source #

Add a new Edge to the graph from src to dst. If either the source or destination is not in the graph, returns Nothing. Otherwise, the Edge reference is returned.

Instances

Instances details

MAddEdge MDigraph Source #
Instance details Defined in Data.Graph.Haggle.Digraph Methods addEdge :: (PrimMonad m, MonadRef m) => MDigraph m -> Vertex -> Vertex -> m (Maybe 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 #
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 #
MAddEdge g => MAddEdge (VertexLabeledMGraph g nl) Source #
Instance details Defined in Data.Graph.Haggle.VertexLabelAdapter Methods addEdge :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> Vertex -> Vertex -> m (Maybe Edge) Source #

class MGraph g => MAddVertex g where Source #

Methods

addVertex :: (PrimMonad m, MonadRef m) => g m -> m Vertex Source #

Add a new Vertex to the graph, returning its handle.

Instances

Instances details

MAddVertex MDigraph Source #
Instance details Defined in Data.Graph.Haggle.Digraph Methods addVertex :: (PrimMonad m, MonadRef m) => MDigraph m -> m Vertex Source #
MAddVertex MBiDigraph Source #
Instance details Defined in Data.Graph.Haggle.BiDigraph Methods addVertex :: (PrimMonad m, MonadRef m) => MBiDigraph m -> m Vertex Source #
MAddVertex MSimpleBiDigraph Source #
Instance details Defined in Data.Graph.Haggle.SimpleBiDigraph Methods addVertex :: (PrimMonad m, MonadRef m) => MSimpleBiDigraph m -> m Vertex Source #
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 #

class MGraph g => MRemovable g where Source #

An interface for graphs that allow vertex and edge removal. Note that implementations are not required to reclaim storage from removed vertices (just make them inaccessible).

Methods

removeVertex :: (PrimMonad m, MonadRef m) => g m -> Vertex -> m () Source #

removeEdgesBetween :: (PrimMonad m, MonadRef m) => g m -> Vertex -> Vertex -> m () Source #

removeEdge :: (PrimMonad m, MonadRef m) => g m -> Edge -> m () Source #

class MGraph g => MBidirectional g where Source #

An interface for graphs that support looking at predecessor (incoming edges) efficiently.

Methods

getPredecessors :: (PrimMonad m, MonadRef m) => g m -> Vertex -> m [Vertex] Source #

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

Instances

Instances details

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 #
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 #
MBidirectional g => MBidirectional (VertexLabeledMGraph g nl) Source #
Instance details Defined in Data.Graph.Haggle.VertexLabelAdapter Methods getPredecessors :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> Vertex -> m [Vertex] Source # getInEdges :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> Vertex -> m [Edge] 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 #
MBidirectional g => MBidirectional (LabeledMGraph g nl el) Source #
Instance details Defined in Data.Graph.Haggle.Internal.Adapter Methods getPredecessors :: (PrimMonad m, MonadRef m) => LabeledMGraph g nl el m -> Vertex -> m [Vertex] Source # getInEdges :: (PrimMonad m, MonadRef m) => LabeledMGraph g nl el m -> Vertex -> m [Edge] Source #

class MGraph g => MLabeledEdge g where Source #

Minimal complete definition

unsafeGetEdgeLabel, addLabeledEdge

Associated Types

type MEdgeLabel g Source #

Methods

getEdgeLabel :: (PrimMonad m, MonadRef m) => g m -> Edge -> m (Maybe (MEdgeLabel g)) Source #

unsafeGetEdgeLabel :: (PrimMonad m, MonadRef m) => g m -> Edge -> m (MEdgeLabel g) Source #

addLabeledEdge :: (PrimMonad m, MonadRef m) => g m -> Vertex -> Vertex -> MEdgeLabel g -> m (Maybe Edge) Source #

Instances

Instances details

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 #
MAddEdge g => MLabeledEdge (LabeledMGraph g nl el) Source #
Instance details Defined in Data.Graph.Haggle.Internal.Adapter Associated Types type MEdgeLabel (LabeledMGraph g nl el) Source # Methods getEdgeLabel :: (PrimMonad m, MonadRef m) => LabeledMGraph g nl el m -> Edge -> m (Maybe (MEdgeLabel (LabeledMGraph g nl el))) Source # unsafeGetEdgeLabel :: (PrimMonad m, MonadRef m) => LabeledMGraph g nl el m -> Edge -> m (MEdgeLabel (LabeledMGraph g nl el)) Source # addLabeledEdge :: (PrimMonad m, MonadRef m) => LabeledMGraph g nl el m -> Vertex -> Vertex -> MEdgeLabel (LabeledMGraph g nl el) -> m (Maybe Edge) Source #

class MGraph g => MLabeledVertex g where Source #

Minimal complete definition

getVertexLabel, addLabeledVertex

Associated Types

type MVertexLabel g Source #

Methods

getVertexLabel :: (PrimMonad m, MonadRef m) => g m -> Vertex -> m (Maybe (MVertexLabel g)) Source #

addLabeledVertex :: (PrimMonad m, MonadRef m) => g m -> MVertexLabel g -> m Vertex Source #

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

Instances

Instances details

MAddVertex g => MLabeledVertex (VertexLabeledMGraph g nl) Source #
Instance details Defined in Data.Graph.Haggle.VertexLabelAdapter Associated Types type MVertexLabel (VertexLabeledMGraph g nl) Source # Methods getVertexLabel :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> Vertex -> m (Maybe (MVertexLabel (VertexLabeledMGraph g nl))) Source # addLabeledVertex :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> MVertexLabel (VertexLabeledMGraph g nl) -> m Vertex Source # getLabeledVertices :: (PrimMonad m, MonadRef m) => VertexLabeledMGraph g nl m -> m [(Vertex, MVertexLabel (VertexLabeledMGraph g nl))] Source #
MAddVertex g => MLabeledVertex (LabeledMGraph g nl el) Source #
Instance details Defined in Data.Graph.Haggle.Internal.Adapter Associated Types type MVertexLabel (LabeledMGraph g nl el) Source # Methods getVertexLabel :: (PrimMonad m, MonadRef m) => LabeledMGraph g nl el m -> Vertex -> m (Maybe (MVertexLabel (LabeledMGraph g nl el))) Source # addLabeledVertex :: (PrimMonad m, MonadRef m) => LabeledMGraph g nl el m -> MVertexLabel (LabeledMGraph g nl el) -> m Vertex Source # getLabeledVertices :: (PrimMonad m, MonadRef m) => LabeledMGraph g nl el m -> m [(Vertex, MVertexLabel (LabeledMGraph g nl el))] Source #

Immutable Graphs

class Graph g where Source #

The basic interface of immutable graphs.

Minimal complete definition

vertices, edges, successors, outEdges, maxVertexId, isEmpty

Methods

vertices :: g -> [Vertex] Source #

edges :: g -> [Edge] Source #

successors :: g -> Vertex -> [Vertex] Source #

outEdges :: g -> Vertex -> [Edge] Source #

maxVertexId :: g -> Int Source #

isEmpty :: g -> Bool Source #

edgesBetween :: g -> Vertex -> Vertex -> [Edge] Source #

This has a default implementation in terms of outEdges, but is part of the class so that instances can offer a more efficient implementation when possible.

Instances

Instances details

Graph Digraph Source #
Instance details Defined in Data.Graph.Haggle.Digraph Methods vertices :: Digraph -> [Vertex] Source # edges :: Digraph -> [Edge] Source # successors :: Digraph -> Vertex -> [Vertex] Source # outEdges :: Digraph -> Vertex -> [Edge] Source # maxVertexId :: Digraph -> Int Source # isEmpty :: Digraph -> Bool Source # edgesBetween :: Digraph -> Vertex -> Vertex -> [Edge] 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 #
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 #
Graph (PatriciaTree nl el) Source #
Instance details Defined in Data.Graph.Haggle.PatriciaTree Methods vertices :: PatriciaTree nl el -> [Vertex] Source # edges :: PatriciaTree nl el -> [Edge] Source # successors :: PatriciaTree nl el -> Vertex -> [Vertex] Source # outEdges :: PatriciaTree nl el -> Vertex -> [Edge] Source # maxVertexId :: PatriciaTree nl el -> Int Source # isEmpty :: PatriciaTree nl el -> Bool Source # edgesBetween :: PatriciaTree nl el -> Vertex -> Vertex -> [Edge] Source #
Graph g => Graph (VertexLabeledGraph g nl) Source #
Instance details Defined in Data.Graph.Haggle.VertexLabelAdapter Methods vertices :: VertexLabeledGraph g nl -> [Vertex] Source # edges :: VertexLabeledGraph g nl -> [Edge] Source # successors :: VertexLabeledGraph g nl -> Vertex -> [Vertex] Source # outEdges :: VertexLabeledGraph g nl -> Vertex -> [Edge] Source # maxVertexId :: VertexLabeledGraph g nl -> Int Source # isEmpty :: VertexLabeledGraph g nl -> Bool Source # edgesBetween :: VertexLabeledGraph g nl -> Vertex -> Vertex -> [Edge] 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 => Graph (LabeledGraph g nl el) Source #
Instance details Defined in Data.Graph.Haggle.Internal.Adapter Methods vertices :: LabeledGraph g nl el -> [Vertex] Source # edges :: LabeledGraph g nl el -> [Edge] Source # successors :: LabeledGraph g nl el -> Vertex -> [Vertex] Source # outEdges :: LabeledGraph g nl el -> Vertex -> [Edge] Source # maxVertexId :: LabeledGraph g nl el -> Int Source # isEmpty :: LabeledGraph g nl el -> Bool Source # edgesBetween :: LabeledGraph g nl el -> Vertex -> Vertex -> [Edge] Source #

edgeExists :: Graph g => g -> Vertex -> Vertex -> Bool Source #

class Graph g => Thawable g where Source #

Associated Types

type MutableGraph g :: (Type -> Type) -> Type Source #

Methods

thaw :: (PrimMonad m, MonadRef m) => g -> m (MutableGraph g m) Source #

Instances

Instances details

Thawable Digraph Source #
Instance details Defined in Data.Graph.Haggle.Digraph Associated Types type MutableGraph Digraph :: (Type -> Type) -> Type Source # Methods thaw :: (PrimMonad m, MonadRef m) => Digraph -> m (MutableGraph Digraph m) 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 #
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 #
Thawable g => Thawable (VertexLabeledGraph g nl) Source #
Instance details Defined in Data.Graph.Haggle.VertexLabelAdapter Associated Types type MutableGraph (VertexLabeledGraph g nl) :: (Type -> Type) -> Type Source # Methods thaw :: (PrimMonad m, MonadRef m) => VertexLabeledGraph g nl -> m (MutableGraph (VertexLabeledGraph g nl) m) 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 #
Thawable g => Thawable (LabeledGraph g nl el) Source #
Instance details Defined in Data.Graph.Haggle.Internal.Adapter Associated Types type MutableGraph (LabeledGraph g nl el) :: (Type -> Type) -> Type Source # Methods thaw :: (PrimMonad m, MonadRef m) => LabeledGraph g nl el -> m (MutableGraph (LabeledGraph g nl el) m) Source #

class Graph g => Bidirectional g where Source #

The interface for immutable graphs with efficient access to incoming edges.

Methods

predecessors :: g -> Vertex -> [Vertex] Source #

inEdges :: g -> Vertex -> [Edge] Source #

Instances

Instances details

Bidirectional BiDigraph Source #
Instance details Defined in Data.Graph.Haggle.BiDigraph Methods predecessors :: BiDigraph -> Vertex -> [Vertex] Source # inEdges :: BiDigraph -> Vertex -> [Edge] Source #
Bidirectional SimpleBiDigraph Source #
Instance details Defined in Data.Graph.Haggle.SimpleBiDigraph Methods predecessors :: SimpleBiDigraph -> Vertex -> [Vertex] Source # inEdges :: SimpleBiDigraph -> Vertex -> [Edge] Source #
Bidirectional (PatriciaTree nl el) Source #
Instance details Defined in Data.Graph.Haggle.PatriciaTree Methods predecessors :: PatriciaTree nl el -> Vertex -> [Vertex] Source # inEdges :: PatriciaTree nl el -> Vertex -> [Edge] Source #
Bidirectional g => Bidirectional (VertexLabeledGraph g nl) Source #
Instance details Defined in Data.Graph.Haggle.VertexLabelAdapter Methods predecessors :: VertexLabeledGraph g nl -> Vertex -> [Vertex] Source # inEdges :: VertexLabeledGraph g nl -> Vertex -> [Edge] Source #
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 => Bidirectional (LabeledGraph g nl el) Source #
Instance details Defined in Data.Graph.Haggle.Internal.Adapter Methods predecessors :: LabeledGraph g nl el -> Vertex -> [Vertex] Source # inEdges :: LabeledGraph g nl el -> Vertex -> [Edge] Source #

class Graph g => HasEdgeLabel g where Source #

The interface for immutable graphs with labeled edges.

Minimal complete definition

edgeLabel, labeledEdges

Associated Types

type EdgeLabel g Source #

Methods

edgeLabel :: g -> Edge -> Maybe (EdgeLabel g) Source #

labeledEdges :: g -> [(Edge, EdgeLabel g)] Source #

labeledOutEdges :: g -> Vertex -> [(Edge, EdgeLabel g)] Source #

Instances

Instances details

HasEdgeLabel (PatriciaTree nl el) Source #
Instance details Defined in Data.Graph.Haggle.PatriciaTree Associated Types type EdgeLabel (PatriciaTree nl el) Source # Methods edgeLabel :: PatriciaTree nl el -> Edge -> Maybe (EdgeLabel (PatriciaTree nl el)) Source # labeledEdges :: PatriciaTree nl el -> [(Edge, EdgeLabel (PatriciaTree nl el))] Source # labeledOutEdges :: PatriciaTree nl el -> Vertex -> [(Edge, EdgeLabel (PatriciaTree nl el))] 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 #
Graph g => HasEdgeLabel (LabeledGraph g nl el) Source #
Instance details Defined in Data.Graph.Haggle.Internal.Adapter Associated Types type EdgeLabel (LabeledGraph g nl el) Source # Methods edgeLabel :: LabeledGraph g nl el -> Edge -> Maybe (EdgeLabel (LabeledGraph g nl el)) Source # labeledEdges :: LabeledGraph g nl el -> [(Edge, EdgeLabel (LabeledGraph g nl el))] Source # labeledOutEdges :: LabeledGraph g nl el -> Vertex -> [(Edge, EdgeLabel (LabeledGraph g nl el))] Source #

class Graph g => HasVertexLabel g where Source #

The interface for immutable graphs with labeled vertices.

Associated Types

type VertexLabel g Source #

Methods

vertexLabel :: g -> Vertex -> Maybe (VertexLabel g) Source #

labeledVertices :: g -> [(Vertex, VertexLabel g)] Source #

Instances

Instances details

HasVertexLabel (PatriciaTree nl el) Source #
Instance details Defined in Data.Graph.Haggle.PatriciaTree Associated Types type VertexLabel (PatriciaTree nl el) Source # Methods vertexLabel :: PatriciaTree nl el -> Vertex -> Maybe (VertexLabel (PatriciaTree nl el)) Source # labeledVertices :: PatriciaTree nl el -> [(Vertex, VertexLabel (PatriciaTree nl el))] Source #
Graph g => HasVertexLabel (VertexLabeledGraph g nl) Source #
Instance details Defined in Data.Graph.Haggle.VertexLabelAdapter Associated Types type VertexLabel (VertexLabeledGraph g nl) Source # Methods vertexLabel :: VertexLabeledGraph g nl -> Vertex -> Maybe (VertexLabel (VertexLabeledGraph g nl)) Source # labeledVertices :: VertexLabeledGraph g nl -> [(Vertex, VertexLabel (VertexLabeledGraph g nl))] Source #
Graph g => HasVertexLabel (LabeledGraph g nl el) Source #
Instance details Defined in Data.Graph.Haggle.Internal.Adapter Associated Types type VertexLabel (LabeledGraph g nl el) Source # Methods vertexLabel :: LabeledGraph g nl el -> Vertex -> Maybe (VertexLabel (LabeledGraph g nl el)) Source # labeledVertices :: LabeledGraph g nl el -> [(Vertex, VertexLabel (LabeledGraph g nl el))] Source #

class (HasEdgeLabel g, Bidirectional g) => BidirectionalEdgeLabel g where Source #

Minimal complete definition

Nothing

Methods

labeledInEdges :: g -> Vertex -> [(Edge, EdgeLabel g)] Source #

Instances

Instances details

BidirectionalEdgeLabel (PatriciaTree nl el) Source #
Instance details Defined in Data.Graph.Haggle.PatriciaTree Methods labeledInEdges :: PatriciaTree nl el -> Vertex -> [(Edge, EdgeLabel (PatriciaTree nl el))] 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 #
Bidirectional g => BidirectionalEdgeLabel (LabeledGraph g nl el) Source #
Instance details Defined in Data.Graph.Haggle.Internal.Adapter Methods labeledInEdges :: LabeledGraph g nl el -> Vertex -> [(Edge, EdgeLabel (LabeledGraph g nl el))] Source #

Inductive Graphs

class (Graph g, HasEdgeLabel g, HasVertexLabel g) => InductiveGraph g where Source #

Minimal complete definition

emptyGraph, match, context, insertLabeledVertex, insertLabeledEdge, deleteEdge, deleteEdgesBetween

Methods

emptyGraph :: g Source #

The empty inductive graph

match :: g -> Vertex -> Maybe (Context g, g) Source #

The call

let (c, g') = match g v

decomposes the graph into the Context c of v and the rest of the graph g'.

context :: g -> Vertex -> Maybe (Context g) Source #

Return the context of a Vertex

insertLabeledVertex :: g -> VertexLabel g -> (Vertex, g) Source #

Insert a new labeled Vertex into the graph.

insertLabeledEdge :: g -> Vertex -> Vertex -> EdgeLabel g -> Maybe (Edge, g) Source #

Must return Nothing if either the source or destination Vertex is not in the graph. Also returns Nothing if the edge already exists and the underlying graph does not support parallel edges.

Otherwise return the inserted Edge and updated graph.

deleteEdge :: g -> Edge -> g Source #

Delete the given Edge. In a multigraph, this lets you remove a single parallel edge between two vertices.

deleteEdgesBetween :: g -> Vertex -> Vertex -> g Source #

Delete all edges between a pair of vertices.

replaceLabeledEdge :: g -> Vertex -> Vertex -> EdgeLabel g -> Maybe (Edge, g) Source #

Like insertLabeledEdge, but overwrite any existing edges. Equivalent to:

let g' = deleteEdgesBetween g v1 v2
in insertLabeledEdge g v1 v2 lbl

deleteVertex :: g -> Vertex -> g Source #

Remove a Vertex from the graph

Instances

Instances details

InductiveGraph (PatriciaTree nl el) Source #

Instance details

Defined in Data.Graph.Haggle.PatriciaTree

Methods

emptyGraph :: PatriciaTree nl el Source #

match :: PatriciaTree nl el -> Vertex -> Maybe (Context (PatriciaTree nl el), PatriciaTree nl el) Source #

context :: PatriciaTree nl el -> Vertex -> Maybe (Context (PatriciaTree nl el)) Source #

insertLabeledVertex :: PatriciaTree nl el -> VertexLabel (PatriciaTree nl el) -> (Vertex, PatriciaTree nl el) Source #

insertLabeledEdge :: PatriciaTree nl el -> Vertex -> Vertex -> EdgeLabel (PatriciaTree nl el) -> Maybe (Edge, PatriciaTree nl el) Source #

deleteEdge :: PatriciaTree nl el -> Edge -> PatriciaTree nl el Source #

deleteEdgesBetween :: PatriciaTree nl el -> Vertex -> Vertex -> PatriciaTree nl el Source #

replaceLabeledEdge :: PatriciaTree nl el -> Vertex -> Vertex -> EdgeLabel (PatriciaTree nl el) -> Maybe (Edge, PatriciaTree nl el) Source #

deleteVertex :: PatriciaTree nl el -> Vertex -> PatriciaTree nl el Source #

data Context g Source #

Contexts represent the "context" of a Vertex, which includes the incoming edges of the Vertex, the label of the Vertex, and the outgoing edges of the Vertex.

Constructors

Context [(EdgeLabel g, Vertex)] (VertexLabel g) [(EdgeLabel g, Vertex)]