Index of modules

Abstract Persistent Unlabeled Graphs.

Abstract Imperative Unlabeled Graphs.

Abstract Persistent Labeled Graphs.

Abstract Imperative Labeled Graphs.

Implements strategy algorithms on graphs

Extension for the module X.

Breadth-first search

Breadth-first search

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

Cartesian product of two comparable types.

Set of original vertices

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

Check for a path.

Choose an element in a graph

Classic graphs

Some classic graphs

Graph cliques

The clique tree graph type

Clique tree vertex type

Original graph vertex

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

k-coloring of undirected graphs.

The CommonAttributes module defines attributes for graphs, vertices and edges that are available in the two engines, dot and neato.

Strongly connected components

Strongly connected components.

Persistent Unlabeled Graphs.

Imperative Unlabeled Graphs.

Imperative Unlabeled, bidirectional graph.

Imperative Unlabeled, bidirectional graph.

Imperative Labeled and bidirectional graph.

Imperative Labeled and bidirectional graph.

Persistent Labeled Graphs.

Imperative Labeled Graphs.

Edge contraction for directed, edge-labeled graphs

Create a vertex type with some data attached to it

Delaunay triangulation.

Depth-first search

Depth-first search

Persistent Directed Graphs.

Directed imperative graphs with edges and vertices labeled with integer.

Imperative Directed Graphs implemented with adjacency matrices.

Imperative Directed Graphs.

Dominators

Parser for DOT file format.

DotAttributes extends CommonAttributes and implements ATTRIBUTES.

AST for DOT file format.

Edges

Edges have type E.t and are labeled with type E.label.

Provide a mapping function from a mapping of edges.

Fixpoint computation implemented using the work list algorithm.

Delaunay triangulation with floating point coordinates

Points with floating point coordinates

Algorithms on flows

Implementation of a graph

Functor providing an implementation of Kruskal's minimum-spanning-tree algorithm using a user-defined union-find algorithm.

Graph mapping.

Parser and pretty-printer for GML file format.

Persistent Undirected Graphs.

Undirected imperative graphs with edges and vertices labeled with integer.

Imperative Undirected Graphs implemented with adjacency matrices.

Imperative Undirected Graphs.

Generic GraphMl Printer

Interface with GraphViz

Hash tables used to store the coloring

Cartesian product of two hashable types.

Random imperative planar graphs

Random imperative graphs

Basic operations over imperative graphs

Implementation for an imperative graph.

Extension for the module G.

Classic Imperative Graphs

Imperative Graphs Builders.

Imperative Graph Implementations.

Delaunay triangulation with integer coordinates

Points with integer coordinates

Kruskal's minimum-spanning-tree algorithm.

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

Map used to store the result of the analysis

Functor providing topological iterators over a graph.

Random planar graphs

Random graphs

Functor providing an implementation of Prim's minimum-spanning-tree algorithm.

Basic operations over graphs

Functor providing an implementation of Kruskal's minimum-spanning-tree algorithm.

Generic Delaunay triangulation

Functor providing functions to compute strongly connected components of a graph.

Provide a function for k-coloring a graph.

Provide the same features than Topological.Make, except that the resulting topological ordering is stable according to vertices comparison: if two vertices v1 and v2 are topologically equal, v1 is presented first to the iterator if and only if G.V.compare v1 v2 <= 0.

Graph traversal with marking.

Vertices contains integers marks, which can be set or used by some algorithms (see for instance module Marking below)

Mark on vertices.

Provide a function for k-coloring a graph with integer marks.

Graph traversal with marking

Imperative graphs implemented as adjacency matrices.

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

Neighbourhood of vertex / vertices

Weighted graphs without negative-cycles.

Cartesian product of two ordered types.

Basic operations over graphs

Random persistent planar graphs

Random persistent graphs

Basic operations over persistent graphs

Implementation for a persistent graph

Extension for the module G.

Classic Persistent Graphs

Persistent Graphs Builders.

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

Provide a parser for GML file format.

Provide a parser for DOT file format.

Paths

Path checking

Persistent Graph Implementations.

Persistent graphs with negative-cycle prevention

Graphml Printer given a graph and required info

Provide a pretty-printer for GML file format.

Random graph generation.

Random graphs

Signatures for graph implementations.

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

Strategies

Topological order.

Topological order

Graph traversal.

Some useful operations.

Vertices

Vertices have type V.t and are labeled with type V.label (note that an implementation may identify the vertex with its label)

Implementation of a set of Vertex_Set

Provide a mapping function from a mapping of vertices.

Implementation of a set of vertex

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