Modulefgl-5.8.2.0Haskell98

Data.Graph.Inductive.Basic

Basic Graph Algorithms

Graph Operations

5 declarations

valuegrev :: DynGraph gr => gr a b -> gr a b

Reverse the direction of all edges.

valueundir :: (Eq b, DynGraph gr) => gr a b -> gr a b

Make the graph undirected, i.e. for every edge from A to B, there exists an edge from B to A.

valueunlab :: DynGraph gr => gr a b -> gr () ()

Remove all labels.

valuegsel :: Graph gr => (Context a b -> Bool) -> gr a b -> [Context a b]

Return all Contexts for which the given function returns True.

valuegfold

Directed graph fold.

2 declarations

valueefilter :: DynGraph gr => (LEdge b -> Bool) -> gr a b -> gr a b

Filter based on edge property.

valueelfilter :: DynGraph gr => (b -> Bool) -> gr a b -> gr a b

Filter based on edge label property.

2 declarations

valuehasLoop :: Graph gr => gr a b -> Bool

True if the graph has any edges of the form (A, A).

valueisSimple :: Graph gr => gr a b -> Bool

The inverse of hasLoop.

4 declarations

valuepostorder :: Tree a -> [a]

Flatten a Tree, returning the elements in post-order.

valuepostorderF :: [Tree a] -> [a]

Flatten multiple Trees in post-order.

valuepreorder :: Tree a -> [a]

Flatten a Tree, returning the elements in pre-order. Equivalent to flatten in Tree.

valuepreorderF :: [Tree a] -> [a]

Flatten multiple Trees in pre-order.