Safe Haskell	None
Language	Haskell2010

Data.Graph.Inductive.Query.Ear

Description

Ear decomposition of a graph.

Synopsis

Documentation

ears :: forall gr. DynGraph gr => gr () () -> gr () Int Source

The ears function takes a graph with no node or edge annotation and produces an ear decomposition. Each edge is annotated with a weight. Edges with the same weight are in the same ear. Maon, Schieber, Vishkin (1986)

shortestPaths :: Gr () Int -> Edge -> LEdge Int Source

lca :: [[Node]] -> LEdge () -> LEdge Int Source

Lowest common ancestor calculation

swap12 :: (t1, t, t2) -> (t, t1, t2) Source

sel3 :: (t, t1, t2) -> t2 Source

treeToEdges :: Tree Node -> [Edge] Source

treeToPaths :: Tree Node -> [[Node]] Source