HGraph.Directed.AdjacencyMap

Documentation

data Digraph a

Instances

Adjacency Digraph

Defined in HGraph.Directed.AdjacencyMap

Methods

outneighbors :: Digraph a -> a -> [a]

inneighbors :: Digraph a -> a -> [a]

outdegree :: Integral b => Digraph a -> a -> b

indegree :: Integral b => Digraph a -> a -> b

incomingArcs :: Digraph a -> a -> [(a, a)]

outgoingArcs :: Digraph a -> a -> [(a, a)]

arcExists :: Digraph a -> (a, a) -> Bool

metaBfs :: Ord a => Digraph a -> a -> ([a] -> [a]) -> ([a] -> [a]) -> [a]

DirectedGraph Digraph

Defined in HGraph.Directed.AdjacencyMap

Methods

empty :: Digraph a -> Digraph a

vertices :: Digraph a -> [a]

numVertices :: Integral b => Digraph a -> b

arcs :: Digraph a -> [(a, a)]

numArcs :: Integral b => Digraph a -> b

linearizeVertices :: Digraph a -> (Digraph Int, [(Int, a)])

isVertex :: Digraph a -> a -> Bool

Mutable Digraph

Defined in HGraph.Directed.AdjacencyMap

Methods

addVertex :: a -> Digraph a -> Digraph a

removeVertex :: a -> Digraph a -> Digraph a

addArc :: (a, a) -> Digraph a -> Digraph a

removeArc :: (a, a) -> Digraph a -> Digraph a

emptyDigraph :: Ord a => Digraph a

module HGraph.Directed