HGraph.Directed

Documentation

class DirectedGraph t where

Minimal complete definition

empty, vertices, arcs, linearizeVertices, isVertex

Methods

empty :: t a -> t a

vertices :: t a -> [a]

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

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

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

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

isVertex :: t a -> a -> Bool

Instances

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

class Adjacency t where

Minimal complete definition

outneighbors, inneighbors, arcExists

Methods

outneighbors :: t a -> a -> [a]

inneighbors :: t a -> a -> [a]

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

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

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

metaBfs :: Ord a => t a -> a -> ([a] -> [a]) -> ([a] -> [a]) -> [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

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

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

class Mutable t where

Methods

addVertex :: a -> t a -> t a

removeVertex :: a -> t a -> t a

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

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

Instances

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