Sig | Signatures for graph implementations. |
Sig_pack | Immediate access to the library: contain a signature gathering an imperative graph signature and all algorithms. |
Dot_ast | AST for DOT file format. |
Util | Some useful operations. |
Persistent | Persistent Graph Implementations. |
Imperative | Imperative Graph Implementations. |
Delaunay | Delaunay triangulation. |
Builder | Graph builders in order to persistent/imperative graphs sharing a same signature. |
Classic | Some classic graphs |
Rand | Random graph generation. |
Oper | Basic operations over graphs |
Components | Strongly connected components. |
Path | Paths |
Nonnegative | Weighted graphs without negative-cycles. |
Traverse | Graph traversal. |
Coloring |
|
Topological | Topological order. |
Kruskal | Kruskal's minimum-spanning-tree algorithm. |
Flow | Algorithms on flows |
Prim | |
Dominator | Dominators |
Graphviz | Interface with GraphViz |
Gml | Parser and pretty-printer for GML file format. |
Dot | Parser for DOT file format. |
Pack | Immediate access to the library: provides implementation of imperative graphs labeled with integer as well as algorithms on such graphs. |
Gmap | Graph mapping. |
Minsep | Minimal separators of a graph |
Cliquetree | Construction of the clique tree of a graph and recognition of chordal graphs. |
Mcs_m | Maximal Cardinality Search (MCS-M) algorithm |
Md | Minimum Degree algorithm |
Strat | Strategies |
Fixpoint | Fixpoint computation implemented using the work list algorithm. |
Leaderlist | The leader list algorithm; it generates a list of basic blocks from a directed graph. |
Contraction | Edge contraction for directed, edge-labeled graphs |
Graphml | Generic GraphMl Printer |
Merge | Provides functions to extend any module satisfying one of the signatures Sig.P, Sig.I and Builder.S . |
Mincut | Minimal cutset of a graph |
Clique | Graph cliques |
WeakTopological | Weak topological ordering of the vertices of a graph, as described by François Bourdoncle. |
ChaoticIteration | Fixpoint computation with widenings using weak topological
orderings as defined by François Bourdoncle and implemented
in |