module Sig : sig ... endSignatures for graph implementations.
module Sig_pack : sig ... endImmediate 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 ... endAST for DOT file format.
module Util : sig ... endSome useful operations.
module Blocks : sig ... endCommon implementation to persistent and imperative graphs.
module Persistent : sig ... endPersistent Graph Implementations.
module Imperative : sig ... endImperative Graph Implementations.
module Delaunay : sig ... endDelaunay triangulation.
module Builder : sig ... endGraph builders in order to persistent/imperative graphs sharing a same signature.
module Classic : sig ... endSome classic graphs
module Rand : sig ... endRandom graph generation.
module Oper : sig ... endBasic operations over graphs
module Components : sig ... endStrongly connected components.
module Path : sig ... endPaths
module Cycles : sig ... endAlgorithms related to cycles in directed graphs.
module Nonnegative : sig ... endWeighted graphs without negative-cycles.
module Traverse : sig ... endGraph traversal.
module Coloring : sig ... endk-coloring of undirected graphs.
module Topological : sig ... endTopological order.
module Kruskal : sig ... endKruskal's minimum-spanning-tree algorithm.
module Flow : sig ... endAlgorithms on flows
module Prim : sig ... endmodule Dominator : sig ... endDominators
module Graphviz : sig ... endInterface with GraphViz
module Gml : sig ... endParser and pretty-printer for GML file format.
module Dot : sig ... endParser for DOT file format.
module Pack : sig ... endImmediate access to the library: provides implementation of imperative graphs labeled with integer as well as algorithms on such graphs.
module Gmap : sig ... endGraph mapping. Map a graph to another one.
module Minsep : sig ... endMinimal separators of a graph
module Cliquetree : sig ... endConstruction of the clique tree of a graph and recognition of chordal graphs.
module Mcs_m : sig ... endMaximal Cardinality Search (MCS-M) algorithm
module Md : sig ... endMinimum Degree algorithm
module Strat : sig ... endStrategies
module Fixpoint : sig ... endFixpoint computation implemented using the work list algorithm. This module makes writing data-flow analysis easy.
module Leaderlist : sig ... endThe 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.
module Contraction : sig ... endEdge contraction for directed, edge-labeled graphs
module Graphml : sig ... endGeneric GraphMl Printer
module Merge : sig ... endProvides functions to extend any module satisfying one of the signatures Sig.P, Sig.I and Builder.S .
module Mincut : sig ... endMinimal cutset of a graph
module Clique : sig ... endGraph cliques
module WeakTopological : sig ... endWeak topological ordering of the vertices of a graph, as described by François Bourdoncle.
module ChaoticIteration : sig ... endFixpoint computation with widenings using weak topological orderings as defined by François Bourdoncle and implemented in WeakTopological.
module XDotDraw : sig ... endParses xdot drawing operations
module XDot : sig ... endReads layout information from xdot ASTs
module DGraphModel : sig ... endAbstract graph model
module DGraphTreeLayout : sig ... endmodule DGraphSubTree : sig ... endmodule DGraphTreeModel : sig ... endmodule DGraphRandModel : sig ... end