Reverse the direction of all edges.
Modulefgl-5.8.3.1Haskell98
Data.Graph.Inductive.Basic
Basic Graph Algorithms
- Packagefgl-5.8.3.1
- Exports13
- LanguageHaskell98
- LicenceBSD-3-Clause
- SourceBasic.hs
Graph Operations
Make the graph undirected, i.e. for every edge from A to B, there exists an edge from B to A.
Remove all labels.
value
gfold 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 multiple Trees in pre-order.