|
Data.Graph.Inductive.Basic |
|
|
|
|
Description |
Basic Graph Algorithms
|
|
Synopsis |
|
|
|
|
Graph Operations
|
|
|
Reverse the direction of all edges.
|
|
|
Make the graph undirected, i.e. for every edge from A to B, there
exists an edge from B to A.
|
|
|
Remove all labels.
|
|
|
Return all Contexts for which the given function returns True.
|
|
|
:: Graph gr | | => (Context a b -> [Node]) | direction of fold
| -> (Context a b -> c -> d) | depth aggregation
| -> (Maybe d -> c -> c, c) | breadth/level aggregation
| -> [Node] | | -> gr a b | | -> c | | Directed graph fold.
|
|
|
Filter Operations
|
|
|
Filter based on edge property.
|
|
|
Filter based on edge label property.
|
|
Predicates and Classifications
|
|
|
True if the graph has any edges of the form (A, A).
|
|
|
The inverse of hasLoop.
|
|
Tree Operations
|
|
|
Flatten a Tree, returning the elements in post-order.
|
|
|
Flatten multiple Trees in post-order.
|
|
|
Flatten a Tree, returning the elements in pre-order. Equivalent to
flatten in Tree.
|
|
|
Flatten multiple Trees in pre-order.
|
|
Produced by Haddock version 0.9 |