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