Graph builders in order to persistent/imperative graphs sharing a same signature.

Fixpoint computation with widenings using weak topological orderings as defined by François Bourdoncle and implemented in WeakTopological.

Some classic graphs

Graph cliques

Construction of the clique tree of a graph and recognition of chordal graphs.

k-coloring of undirected graphs.

Strongly connected components.

Edge contraction for directed, edge-labeled graphs

Delaunay triangulation.

Dominators

Parser for DOT file format.

AST for DOT file format.

Fixpoint computation implemented using the work list algorithm.

Algorithms on flows

Graph mapping.

Parser and pretty-printer for GML file format.

Generic GraphMl Printer

Interface with GraphViz

Imperative Graph Implementations.

Kruskal's minimum-spanning-tree algorithm.

The leader list algorithm; it generates a list of basic blocks from a directed graph.

Maximal Cardinality Search (MCS-M) algorithm

Minimum Degree algorithm

Provides functions to extend any module satisfying one of the signatures Sig.P, Sig.I and Builder.S .

Minimal cutset of a graph

Minimal separators of a graph

Weighted graphs without negative-cycles.

Basic operations over graphs

Immediate access to the library: provides implementation of imperative graphs labeled with integer as well as algorithms on such graphs.

Paths

Persistent Graph Implementations.

Random graph generation.

Signatures for graph implementations.

Immediate access to the library: contain a signature gathering an imperative graph signature and all algorithms.

Strategies

Topological order.

Graph traversal.

Some useful operations.

Weak topological ordering of the vertices of a graph, as described by François Bourdoncle.