Safe Haskell | None |
---|---|

Language | Haskell2010 |

Ear decomposition of a graph.

# 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)

treeToEdges :: Tree Node -> [Edge] Source

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