Module GraphSource

module Sig : sig ... end

Signatures for graph implementations.

module Sig_pack : sig ... end

Immediate access to the library: contain a signature gathering an imperative graph signature and all algorithms. Vertices and edges are labeled with integers.

module Dot_ast : sig ... end

AST for DOT file format.

Sourcemodule Util : sig ... end

Some useful operations.

Sourcemodule Blocks : sig ... end

Common implementation to persistent and imperative graphs.

Sourcemodule Persistent : sig ... end

Persistent Graph Implementations.

Sourcemodule Imperative : sig ... end

Imperative Graph Implementations.

Sourcemodule Delaunay : sig ... end

Delaunay triangulation.

Sourcemodule Builder : sig ... end

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

Sourcemodule Classic : sig ... end

Some classic graphs

Sourcemodule Rand : sig ... end

Random graph generation.

Sourcemodule Oper : sig ... end

Basic operations over graphs

Sourcemodule Components : sig ... end

Strongly connected components.

Sourcemodule Path : sig ... end

Paths

Sourcemodule Cycles : sig ... end

Algorithms related to cycles in directed graphs.

Sourcemodule Nonnegative : sig ... end

Weighted graphs without negative-cycles.

Sourcemodule Traverse : sig ... end

Graph traversal.

Sourcemodule Coloring : sig ... end

k-coloring of undirected graphs.

Sourcemodule Topological : sig ... end

Topological order.

Sourcemodule Kruskal : sig ... end

Kruskal's minimum-spanning-tree algorithm.

Sourcemodule Flow : sig ... end

Algorithms on flows

Sourcemodule Prim : sig ... end
Sourcemodule Dominator : sig ... end

Dominators

Sourcemodule Graphviz : sig ... end

Interface with GraphViz

Sourcemodule Gml : sig ... end

Parser and pretty-printer for GML file format.

Sourcemodule Dot : sig ... end

Parser for DOT file format.

Sourcemodule Pack : sig ... end

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

Sourcemodule Gmap : sig ... end

Graph mapping. Map a graph to another one.

Sourcemodule Minsep : sig ... end

Minimal separators of a graph

Sourcemodule Cliquetree : sig ... end

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

Sourcemodule Mcs_m : sig ... end

Maximal Cardinality Search (MCS-M) algorithm

Sourcemodule Md : sig ... end

Minimum Degree algorithm

Sourcemodule Strat : sig ... end

Strategies

Sourcemodule Fixpoint : sig ... end

Fixpoint computation implemented using the work list algorithm. This module makes writing data-flow analysis easy.

Sourcemodule Leaderlist : sig ... end

The leader list algorithm; it generates a list of basic blocks from a directed graph. A basic block is a forward path of nodes that requires neither branching from nor into.

Sourcemodule Contraction : sig ... end

Edge contraction for directed, edge-labeled graphs

Sourcemodule Graphml : sig ... end

Generic GraphMl Printer

Sourcemodule Merge : sig ... end

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

Sourcemodule Mincut : sig ... end

Minimal cutset of a graph

Sourcemodule Clique : sig ... end

Graph cliques

Sourcemodule WeakTopological : sig ... end

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

Sourcemodule ChaoticIteration : sig ... end

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

Sourcemodule XDotDraw : sig ... end

Parses xdot drawing operations

Sourcemodule XDot : sig ... end

Reads layout information from xdot ASTs

Sourcemodule DGraphModel : sig ... end

Abstract graph model

Sourcemodule DGraphTreeLayout : sig ... end
Sourcemodule DGraphSubTree : sig ... end
Sourcemodule DGraphTreeModel : sig ... end
Sourcemodule DGraphRandModel : sig ... end