Data.Graph.Inductive.Query.Ear

Ear decomposition of a graph.

Documentation

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

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.

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

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

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

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

treeToEdges :: Tree Node -> [Edge]

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