| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
HGraph.Undirected
Documentation
class UndirectedGraph t where Source #
Minimal complete definition
Methods
vertices :: t a -> [a] Source #
numVertices :: Integral b => t a -> b Source #
edges :: t a -> [(a, a)] Source #
numEdges :: Integral b => t a -> b Source #
linearizeVertices :: t a -> (t Int, [(Int, a)]) Source #
Instances
| UndirectedGraph Graph Source # | |
Defined in HGraph.Undirected.AdjacencyMap | |
class UndirectedGraph t => Adjacency t where Source #
Minimal complete definition
Methods
neighbors :: t a -> a -> [a] Source #
degree :: Integral b => t a -> a -> b Source #
edgeExists :: t a -> (a, a) -> Bool Source #
inducedSubgraph :: t a -> [a] -> t a Source #
metaBfs :: Ord a => t a -> a -> ([a] -> [a]) -> [a] Source #
connectedComponents :: Ord a => t a -> [[a]] Source #
Instances
| Adjacency Graph Source # | |
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 # | |