HGraph.Undirected.AdjacencyMap

Documentation

data Graph a

Instances

Adjacency Graph

Defined in HGraph.Undirected.AdjacencyMap

Methods

neighbors :: Graph a -> a -> [a]

degree :: Integral b => Graph a -> a -> b

edgeExists :: Graph a -> (a, a) -> Bool

inducedSubgraph :: Graph a -> [a] -> Graph a

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

connectedComponents :: Ord a => Graph a -> [[a]]

Mutable Graph

Defined in HGraph.Undirected.AdjacencyMap

Methods

addVertex :: a -> Graph a -> Graph a

removeVertex :: a -> Graph a -> Graph a

addEdge :: (a, a) -> Graph a -> Graph a

removeEdge :: (a, a) -> Graph a -> Graph a

UndirectedGraph Graph

Defined in HGraph.Undirected.AdjacencyMap

Methods

empty :: Graph a -> Graph a

vertices :: Graph a -> [a]

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

edges :: Graph a -> [(a, a)]

numEdges :: Integral b => Graph a -> b

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

emptyGraph :: Ord a => Graph a

module HGraph.Undirected