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

HGraph.Undirected.AdjacencyMap

Documentation

data Graph a Source #

Instances

Instances details
Mutable Graph Source # 
Instance details

Defined in HGraph.Undirected.AdjacencyMap

Methods

addVertex :: Graph a -> a -> Graph a Source #

removeVertex :: Graph a -> a -> Graph a Source #

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

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

Adjacency Graph Source # 
Instance details

Defined in HGraph.Undirected.AdjacencyMap

Methods

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

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

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

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

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

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

UndirectedGraph Graph Source # 
Instance details

Defined in HGraph.Undirected.AdjacencyMap

Methods

empty :: Graph a -> Graph a Source #

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

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

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

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

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