hgraph-1.2.0.1: Tools for working on (di)graphs.
Safe HaskellSafe-Inferred
LanguageHaskell2010

HGraph.Directed.AdjacencyMap

Documentation

data Digraph a Source #

Instances

Instances details
Mutable Digraph Source # 
Instance details

Defined in HGraph.Directed.AdjacencyMap

Methods

addVertex :: a -> Digraph a -> Digraph a Source #

removeVertex :: a -> Digraph a -> Digraph a Source #

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

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

Adjacency Digraph Source # 
Instance details

Defined in HGraph.Directed.AdjacencyMap

Methods

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

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

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

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

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

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

DirectedGraph Digraph Source # 
Instance details

Defined in HGraph.Directed.AdjacencyMap

Methods

empty :: Digraph a -> Digraph a Source #

vertices :: Digraph a -> [a] Source #

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

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

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

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

isVertex :: Digraph a -> a -> Bool Source #