Sophie: ocaml-ocamlgraph-doc-1.1-1mdv2010.1 i586

ocaml-ocamlgraph-doc-1.1-1mdv2010.1.i586.rpm

<html>
<head>
<link rel="stylesheet" href="style.css" type="text/css">
<meta content="text/html; charset=iso-8859-1" http-equiv="Content-Type">
<link rel="Start" href="index.html">
<link title="Index of types" rel=Appendix href="index_types.html">
<link title="Index of exceptions" rel=Appendix href="index_exceptions.html">
<link title="Index of values" rel=Appendix href="index_values.html">
<link title="Index of modules" rel=Appendix href="index_modules.html">
<link title="Index of module types" rel=Appendix href="index_module_types.html">
<link title="Sig" rel="Chapter" href="Sig.html">
<link title="Sig_pack" rel="Chapter" href="Sig_pack.html">
<link title="Dot_ast" rel="Chapter" href="Dot_ast.html">
<link title="Util" rel="Chapter" href="Util.html">
<link title="Persistent" rel="Chapter" href="Persistent.html">
<link title="Imperative" rel="Chapter" href="Imperative.html">
<link title="Delaunay" rel="Chapter" href="Delaunay.html">
<link title="Builder" rel="Chapter" href="Builder.html">
<link title="Classic" rel="Chapter" href="Classic.html">
<link title="Rand" rel="Chapter" href="Rand.html">
<link title="Oper" rel="Chapter" href="Oper.html">
<link title="Path" rel="Chapter" href="Path.html">
<link title="Traverse" rel="Chapter" href="Traverse.html">
<link title="Coloring" rel="Chapter" href="Coloring.html">
<link title="Topological" rel="Chapter" href="Topological.html">
<link title="Components" rel="Chapter" href="Components.html">
<link title="Kruskal" rel="Chapter" href="Kruskal.html">
<link title="Flow" rel="Chapter" href="Flow.html">
<link title="Graphviz" rel="Chapter" href="Graphviz.html">
<link title="Gml" rel="Chapter" href="Gml.html">
<link title="Dot" rel="Chapter" href="Dot.html">
<link title="Pack" rel="Chapter" href="Pack.html">
<link title="Gmap" rel="Chapter" href="Gmap.html">
<link title="Minsep" rel="Chapter" href="Minsep.html">
<link title="Cliquetree" rel="Chapter" href="Cliquetree.html">
<link title="Mcs_m" rel="Chapter" href="Mcs_m.html">
<link title="Md" rel="Chapter" href="Md.html">
<link title="Strat" rel="Chapter" href="Strat.html"><title>Index of modules</title>
</head>
<body>
<center><h1>Index of modules</h1></center>
<table>
<tr><td align="left"><br>A</td></tr>
<tr><td><a href="Imperative.S.Abstract.html">Abstract</a> [<a href="Imperative.S.html">Imperative.S</a>]</td>
<td><div class="info">
Abstract Imperative Unlabeled Graphs.
</div>
</td></tr>
<tr><td><a href="Persistent.S.Abstract.html">Abstract</a> [<a href="Persistent.S.html">Persistent.S</a>]</td>
<td><div class="info">
Abstract Persistent Unlabeled Graphs.
</div>
</td></tr>
<tr><td><a href="Imperative.S.AbstractLabeled.html">AbstractLabeled</a> [<a href="Imperative.S.html">Imperative.S</a>]</td>
<td><div class="info">
Abstract Imperative Labeled Graphs.
</div>
</td></tr>
<tr><td><a href="Persistent.S.AbstractLabeled.html">AbstractLabeled</a> [<a href="Persistent.S.html">Persistent.S</a>]</td>
<td><div class="info">
Abstract Persistent Labeled Graphs.
</div>
</td></tr>
<tr><td><a href="Strat.Algo.html">Algo</a> [<a href="Strat.html">Strat</a>]</td>
<td><div class="info">
Implements strategy algorithms on graphs
</div>
</td></tr>
<tr><td align="left"><br>B</td></tr>
<tr><td><a href="Traverse.Bfs.html">Bfs</a> [<a href="Traverse.html">Traverse</a>]</td>
<td><div class="info">
Breadth-first search
</div>
</td></tr>
<tr><td><a href="Sig_pack.S.Bfs.html">Bfs</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td>
<td><div class="info">
Breadth-first search
</div>
</td></tr>
<tr><td><a href="Builder.html">Builder</a> </td>
<td><div class="info">
Graph builders in order to persistent/imperative graphs sharing a same
    signature.
</div>
</td></tr>
<tr><td align="left"><br>C</td></tr>
<tr><td><a href="Util.CMPProduct.html">CMPProduct</a> [<a href="Util.html">Util</a>]</td>
<td><div class="info">
Cartesian product of two comparable types.
</div>
</td></tr>
<tr><td><a href="Cliquetree.CliqueTree.CVS.html">CVS</a> [<a href="Cliquetree.CliqueTree.html">Cliquetree.CliqueTree</a>]</td>
<td><div class="info">
Set of original vertices
</div>
</td></tr>
<tr><td><a href="Path.Check.html">Check</a> [<a href="Path.html">Path</a>]</td>
<td><div class="info">
Check for a path.
</div>
</td></tr>
<tr><td><a href="Oper.Choose.html">Choose</a> [<a href="Oper.html">Oper</a>]</td>
<td><div class="info">
Choose an element in a graph
</div>
</td></tr>
<tr><td><a href="Classic.html">Classic</a> </td>
<td><div class="info">
Some classic graphs
</div>
</td></tr>
<tr><td><a href="Sig_pack.S.Classic.html">Classic</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td>
<td><div class="info">
Classic graphs
</div>
</td></tr>
<tr><td><a href="Cliquetree.CliqueTree.CliqueTree.html">CliqueTree</a> [<a href="Cliquetree.CliqueTree.html">Cliquetree.CliqueTree</a>]</td>
<td><div class="info">
The clique tree graph type
</div>
</td></tr>
<tr><td><a href="Cliquetree.CliqueTree.html">CliqueTree</a> [<a href="Cliquetree.html">Cliquetree</a>]</td>
<td></td></tr>
<tr><td><a href="Cliquetree.CliqueTree.CliqueTreeE.html">CliqueTreeE</a> [<a href="Cliquetree.CliqueTree.html">Cliquetree.CliqueTree</a>]</td>
<td></td></tr>
<tr><td><a href="Cliquetree.CliqueTree.CliqueTreeV.html">CliqueTreeV</a> [<a href="Cliquetree.CliqueTree.html">Cliquetree.CliqueTree</a>]</td>
<td><div class="info">
Clique tree vertex type
</div>
</td></tr>
<tr><td><a href="Cliquetree.CliqueTree.CliqueV.html">CliqueV</a> [<a href="Cliquetree.CliqueTree.html">Cliquetree.CliqueTree</a>]</td>
<td><div class="info">
Original graph vertex
</div>
</td></tr>
<tr><td><a href="Cliquetree.html">Cliquetree</a> </td>
<td><div class="info">
Construction of the clique tree of a graph and recognition
    of chordal graphs.
</div>
</td></tr>
<tr><td><a href="Coloring.html">Coloring</a> </td>
<td><div class="info">
<code class="code">k</code>-coloring of undirected graphs.
</div>
</td></tr>
<tr><td><a href="Graphviz.CommonAttributes.html">CommonAttributes</a> [<a href="Graphviz.html">Graphviz</a>]</td>
<td><div class="info">
The <code class="code">CommonAttributes</code> module defines attributes for graphs, vertices and
    edges that are available in the two engines, dot and neato.
</div>
</td></tr>
<tr><td><a href="Components.html">Components</a> </td>
<td><div class="info">
Strongly connected components.
</div>
</td></tr>
<tr><td><a href="Sig_pack.S.Components.html">Components</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td>
<td><div class="info">
Strongly connected components
</div>
</td></tr>
<tr><td><a href="Imperative.S.Concrete.html">Concrete</a> [<a href="Imperative.S.html">Imperative.S</a>]</td>
<td><div class="info">
Imperative Unlabeled Graphs.
</div>
</td></tr>
<tr><td><a href="Persistent.S.Concrete.html">Concrete</a> [<a href="Persistent.S.html">Persistent.S</a>]</td>
<td><div class="info">
Persistent Unlabeled Graphs.
</div>
</td></tr>
<tr><td><a href="Imperative.Digraph.ConcreteBidirectional.html">ConcreteBidirectional</a> [<a href="Imperative.Digraph.html">Imperative.Digraph</a>]</td>
<td><div class="info">
Imperative Unlabeled, bidirectional graph (gives predecessors in
      constant time).
</div>
</td></tr>
<tr><td><a href="Imperative.S.ConcreteLabeled.html">ConcreteLabeled</a> [<a href="Imperative.S.html">Imperative.S</a>]</td>
<td><div class="info">
Imperative Labeled Graphs.
</div>
</td></tr>
<tr><td><a href="Persistent.S.ConcreteLabeled.html">ConcreteLabeled</a> [<a href="Persistent.S.html">Persistent.S</a>]</td>
<td><div class="info">
Persistent Labeled Graphs.
</div>
</td></tr>
<tr><td align="left"><br>D</td></tr>
<tr><td><a href="Util.DataV.html">DataV</a> [<a href="Util.html">Util</a>]</td>
<td><div class="info">
Create a vertex type with some data attached to it
</div>
</td></tr>
<tr><td><a href="Delaunay.html">Delaunay</a> </td>
<td><div class="info">
Delaunay triangulation.
</div>
</td></tr>
<tr><td><a href="Traverse.Dfs.html">Dfs</a> [<a href="Traverse.html">Traverse</a>]</td>
<td><div class="info">
Depth-first search
</div>
</td></tr>
<tr><td><a href="Sig_pack.S.Dfs.html">Dfs</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td>
<td><div class="info">
Depth-first search
</div>
</td></tr>
<tr><td><a href="Pack.Digraph.html">Digraph</a> [<a href="Pack.html">Pack</a>]</td>
<td><div class="info">
Directed imperative graphs with edges and vertices labeled with integer.
</div>
</td></tr>
<tr><td><a href="Imperative.Matrix.Digraph.html">Digraph</a> [<a href="Imperative.Matrix.html">Imperative.Matrix</a>]</td>
<td><div class="info">
Imperative Directed Graphs implemented with adjacency matrices.
</div>
</td></tr>
<tr><td><a href="Imperative.Digraph.html">Digraph</a> [<a href="Imperative.html">Imperative</a>]</td>
<td><div class="info">
Imperative Directed Graphs.
</div>
</td></tr>
<tr><td><a href="Persistent.Digraph.html">Digraph</a> [<a href="Persistent.html">Persistent</a>]</td>
<td><div class="info">
Persistent Directed Graphs.
</div>
</td></tr>
<tr><td><a href="Path.Dijkstra.html">Dijkstra</a> [<a href="Path.html">Path</a>]</td>
<td></td></tr>
<tr><td><a href="Dot.html">Dot</a> </td>
<td><div class="info">
Parser for DOT file format.
</div>
</td></tr>
<tr><td><a href="Graphviz.Dot.html">Dot</a> [<a href="Graphviz.html">Graphviz</a>]</td>
<td></td></tr>
<tr><td><a href="Graphviz.DotAttributes.html">DotAttributes</a> [<a href="Graphviz.html">Graphviz</a>]</td>
<td><div class="info">
<code class="code">DotAttributes</code> extends <code class="code">CommonAttributes</code> and implements <code class="code">ATTRIBUTES</code>.
</div>
</td></tr>
<tr><td><a href="Dot_ast.html">Dot_ast</a> </td>
<td><div class="info">
AST for DOT file format.
</div>
</td></tr>
<tr><td align="left"><br>E</td></tr>
<tr><td><a href="Gmap.E_SRC.E.html">E</a> [<a href="Gmap.E_SRC.html">Gmap.E_SRC</a>]</td>
<td></td></tr>
<tr><td><a href="Gml.G.E.html">E</a> [<a href="Gml.G.html">Gml.G</a>]</td>
<td></td></tr>
<tr><td><a href="Flow.G_FORD_FULKERSON.E.html">E</a> [<a href="Flow.G_FORD_FULKERSON.html">Flow.G_FORD_FULKERSON</a>]</td>
<td></td></tr>
<tr><td><a href="Flow.G_GOLDBERG.E.html">E</a> [<a href="Flow.G_GOLDBERG.html">Flow.G_GOLDBERG</a>]</td>
<td></td></tr>
<tr><td><a href="Kruskal.G.E.html">E</a> [<a href="Kruskal.G.html">Kruskal.G</a>]</td>
<td></td></tr>
<tr><td><a href="Path.G.E.html">E</a> [<a href="Path.G.html">Path.G</a>]</td>
<td></td></tr>
<tr><td><a href="Sig_pack.S.E.html">E</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td>
<td><div class="info">
Edges
</div>
</td></tr>
<tr><td><a href="Sig.G.E.html">E</a> [<a href="Sig.G.html">Sig.G</a>]</td>
<td><div class="info">
Edges have type <code class="code">E.t</code> and are labeled with type <code class="code">E.label</code>.
</div>
</td></tr>
<tr><td><a href="Gmap.Edge.html">Edge</a> [<a href="Gmap.html">Gmap</a>]</td>
<td><div class="info">
Provide a mapping function from a mapping of edges.
</div>
</td></tr>
<tr><td align="left"><br>F</td></tr>
<tr><td><a href="Delaunay.Float.html">Float</a> [<a href="Delaunay.html">Delaunay</a>]</td>
<td><div class="info">
Delaunay triangulation with floating point coordinates
</div>
</td></tr>
<tr><td><a href="Delaunay.FloatPoints.html">FloatPoints</a> [<a href="Delaunay.html">Delaunay</a>]</td>
<td><div class="info">
Points with floating point coordinates
</div>
</td></tr>
<tr><td><a href="Flow.html">Flow</a> </td>
<td><div class="info">
Algorithms on flows 
</div>
</td></tr>
<tr><td><a href="Flow.Ford_Fulkerson.html">Ford_Fulkerson</a> [<a href="Flow.html">Flow</a>]</td>
<td></td></tr>
<tr><td align="left"><br>G</td></tr>
<tr><td><a href="Minsep.MINSEP.G.html">G</a> [<a href="Minsep.MINSEP.html">Minsep.MINSEP</a>]</td>
<td><div class="info">
Implementation of a graph
</div>
</td></tr>
<tr><td><a href="Builder.S.G.html">G</a> [<a href="Builder.S.html">Builder.S</a>]</td>
<td></td></tr>
<tr><td><a href="Kruskal.Generic.html">Generic</a> [<a href="Kruskal.html">Kruskal</a>]</td>
<td><div class="info">
Functor providing an implementation of the Kruskal's algorithm computing
    spanning trees using an user-defined union-find algorithm.
</div>
</td></tr>
<tr><td><a href="Gmap.html">Gmap</a> </td>
<td><div class="info">
Graph mapping.
</div>
</td></tr>
<tr><td><a href="Gml.html">Gml</a> </td>
<td><div class="info">
Parser and pretty-printer for GML file format.
</div>
</td></tr>
<tr><td><a href="Flow.Goldberg.html">Goldberg</a> [<a href="Flow.html">Flow</a>]</td>
<td></td></tr>
<tr><td><a href="Pack.Graph.html">Graph</a> [<a href="Pack.html">Pack</a>]</td>
<td><div class="info">
Undirected imperative graphs with edges and vertices labeled with
    integer.
</div>
</td></tr>
<tr><td><a href="Imperative.Matrix.Graph.html">Graph</a> [<a href="Imperative.Matrix.html">Imperative.Matrix</a>]</td>
<td><div class="info">
Imperative Undirected Graphs implemented with adjacency matrices.
</div>
</td></tr>
<tr><td><a href="Imperative.Graph.html">Graph</a> [<a href="Imperative.html">Imperative</a>]</td>
<td><div class="info">
Imperative Undirected Graphs.
</div>
</td></tr>
<tr><td><a href="Persistent.Graph.html">Graph</a> [<a href="Persistent.html">Persistent</a>]</td>
<td><div class="info">
Persistent Undirected Graphs.
</div>
</td></tr>
<tr><td><a href="Graphviz.html">Graphviz</a> </td>
<td><div class="info">
Interface with <i>GraphViz</i>
</div>
</td></tr>
<tr><td align="left"><br>H</td></tr>
<tr><td><a href="Coloring.Make.H.html">H</a> [<a href="Coloring.Make.html">Coloring.Make</a>]</td>
<td><div class="info">
Hash tables used to store the coloring
</div>
</td></tr>
<tr><td><a href="Util.HTProduct.html">HTProduct</a> [<a href="Util.html">Util</a>]</td>
<td><div class="info">
Cartesian product of two hashable types.
</div>
</td></tr>
<tr><td align="left"><br>I</td></tr>
<tr><td><a href="Md.I.html">I</a> [<a href="Md.html">Md</a>]</td>
<td></td></tr>
<tr><td><a href="Mcs_m.MaximalCardinalitySearch.I.html">I</a> [<a href="Mcs_m.MaximalCardinalitySearch.html">Mcs_m.MaximalCardinalitySearch</a>]</td>
<td></td></tr>
<tr><td><a href="Minsep.I.html">I</a> [<a href="Minsep.html">Minsep</a>]</td>
<td><div class="info">
Implementation for an imperative graph.
</div>
</td></tr>
<tr><td><a href="Oper.I.html">I</a> [<a href="Oper.html">Oper</a>]</td>
<td><div class="info">
Basic operations over imperative graphs
</div>
</td></tr>
<tr><td><a href="Rand.Planar.I.html">I</a> [<a href="Rand.Planar.html">Rand.Planar</a>]</td>
<td><div class="info">
Random imperative planar graphs
</div>
</td></tr>
<tr><td><a href="Rand.I.html">I</a> [<a href="Rand.html">Rand</a>]</td>
<td><div class="info">
Random imperative graphs
</div>
</td></tr>
<tr><td><a href="Classic.I.html">I</a> [<a href="Classic.html">Classic</a>]</td>
<td><div class="info">
Classic Imperative Graphs
</div>
</td></tr>
<tr><td><a href="Builder.I.html">I</a> [<a href="Builder.html">Builder</a>]</td>
<td><div class="info">
Imperative Graphs Builders.
</div>
</td></tr>
<tr><td><a href="Imperative.html">Imperative</a> </td>
<td><div class="info">
Imperative Graph Implementations.
</div>
</td></tr>
<tr><td><a href="Delaunay.Int.html">Int</a> [<a href="Delaunay.html">Delaunay</a>]</td>
<td><div class="info">
Delaunay triangulation with integer coordinates
</div>
</td></tr>
<tr><td><a href="Delaunay.IntPoints.html">IntPoints</a> [<a href="Delaunay.html">Delaunay</a>]</td>
<td><div class="info">
Points with integer coordinates
</div>
</td></tr>
<tr><td align="left"><br>K</td></tr>
<tr><td><a href="Kruskal.html">Kruskal</a> </td>
<td><div class="info">
Kruskal's algorithm.
</div>
</td></tr>
<tr><td align="left"><br>M</td></tr>
<tr><td><a href="Kruskal.Make.html">Make</a> [<a href="Kruskal.html">Kruskal</a>]</td>
<td><div class="info">
Functor providing an implementation of the Kruskal's algorithm computing
    spanning trees.
</div>
</td></tr>
<tr><td><a href="Components.Make.html">Make</a> [<a href="Components.html">Components</a>]</td>
<td><div class="info">
Functor providing functions to compute strongly connected components of a
    graph.
</div>
</td></tr>
<tr><td><a href="Topological.Make.html">Make</a> [<a href="Topological.html">Topological</a>]</td>
<td><div class="info">
Functor providing topological iterators over a graph.
</div>
</td></tr>
<tr><td><a href="Coloring.Make.html">Make</a> [<a href="Coloring.html">Coloring</a>]</td>
<td><div class="info">
Provide a function for <code class="code">k</code>-coloring a graph.
</div>
</td></tr>
<tr><td><a href="Oper.Make.html">Make</a> [<a href="Oper.html">Oper</a>]</td>
<td><div class="info">
Basic operations over graphs
</div>
</td></tr>
<tr><td><a href="Rand.Planar.Make.html">Make</a> [<a href="Rand.Planar.html">Rand.Planar</a>]</td>
<td><div class="info">
Random planar graphs
</div>
</td></tr>
<tr><td><a href="Rand.Make.html">Make</a> [<a href="Rand.html">Rand</a>]</td>
<td><div class="info">
Random graphs
</div>
</td></tr>
<tr><td><a href="Delaunay.Make.html">Make</a> [<a href="Delaunay.html">Delaunay</a>]</td>
<td><div class="info">
Generic Delaunay triangulation
</div>
</td></tr>
<tr><td><a href="Coloring.GM.Mark.html">Mark</a> [<a href="Coloring.GM.html">Coloring.GM</a>]</td>
<td></td></tr>
<tr><td><a href="Coloring.Mark.html">Mark</a> [<a href="Coloring.html">Coloring</a>]</td>
<td><div class="info">
Provide a function for <code class="code">k</code>-coloring a graph with integer marks.
</div>
</td></tr>
<tr><td><a href="Traverse.GM.Mark.html">Mark</a> [<a href="Traverse.GM.html">Traverse.GM</a>]</td>
<td></td></tr>
<tr><td><a href="Traverse.Mark.html">Mark</a> [<a href="Traverse.html">Traverse</a>]</td>
<td><div class="info">
Graph traversal with marking.
</div>
</td></tr>
<tr><td><a href="Sig_pack.S.Mark.html">Mark</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td>
<td><div class="info">
Vertices contains integers marks, which can be set or used by some 
      algorithms (see for instance module <code class="code">Marking</code> below)
</div>
</td></tr>
<tr><td><a href="Sig.IM.Mark.html">Mark</a> [<a href="Sig.IM.html">Sig.IM</a>]</td>
<td><div class="info">
Mark on vertices.
</div>
</td></tr>
<tr><td><a href="Sig_pack.S.Marking.html">Marking</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td>
<td><div class="info">
Graph traversal with marking
</div>
</td></tr>
<tr><td><a href="Imperative.Matrix.html">Matrix</a> [<a href="Imperative.html">Imperative</a>]</td>
<td><div class="info">
Imperative graphs implemented as adjacency matrices.
</div>
</td></tr>
<tr><td><a href="Mcs_m.MaximalCardinalitySearch.html">MaximalCardinalitySearch</a> [<a href="Mcs_m.html">Mcs_m</a>]</td>
<td></td></tr>
<tr><td><a href="Mcs_m.html">Mcs_m</a> </td>
<td><div class="info">
Maximal Cardinality Search (MCS-M) algorithm
</div>
</td></tr>
<tr><td><a href="Md.html">Md</a> </td>
<td><div class="info">
Minimum Degree algorithm
</div>
</td></tr>
<tr><td><a href="Minsep.html">Minsep</a> </td>
<td><div class="info">
Minimal separators of a graph
</div>
</td></tr>
<tr><td align="left"><br>N</td></tr>
<tr><td><a href="Graphviz.Neato.html">Neato</a> [<a href="Graphviz.html">Graphviz</a>]</td>
<td></td></tr>
<tr><td><a href="Graphviz.NeatoAttributes.html">NeatoAttributes</a> [<a href="Graphviz.html">Graphviz</a>]</td>
<td><div class="info">
The <code class="code">NeatoAttributes</code> module defines attributes for graphs, nodes and edges
    that are available in the neato engine.
</div>
</td></tr>
<tr><td><a href="Oper.Neighbourhood.html">Neighbourhood</a> [<a href="Oper.html">Oper</a>]</td>
<td><div class="info">
Neighbourhood of vertex / vertices
</div>
</td></tr>
<tr><td align="left"><br>O</td></tr>
<tr><td><a href="Util.OTProduct.html">OTProduct</a> [<a href="Util.html">Util</a>]</td>
<td><div class="info">
Cartesian product of two ordered types.
</div>
</td></tr>
<tr><td><a href="Oper.html">Oper</a> </td>
<td><div class="info">
Basic operations over graphs
</div>
</td></tr>
<tr><td align="left"><br>P</td></tr>
<tr><td><a href="Md.P.html">P</a> [<a href="Md.html">Md</a>]</td>
<td></td></tr>
<tr><td><a href="Mcs_m.MaximalCardinalitySearch.P.html">P</a> [<a href="Mcs_m.MaximalCardinalitySearch.html">Mcs_m.MaximalCardinalitySearch</a>]</td>
<td></td></tr>
<tr><td><a href="Minsep.P.html">P</a> [<a href="Minsep.html">Minsep</a>]</td>
<td><div class="info">
Implementation for a persistent graph
</div>
</td></tr>
<tr><td><a href="Oper.P.html">P</a> [<a href="Oper.html">Oper</a>]</td>
<td><div class="info">
Basic operations over persistent graphs
</div>
</td></tr>
<tr><td><a href="Rand.Planar.P.html">P</a> [<a href="Rand.Planar.html">Rand.Planar</a>]</td>
<td><div class="info">
Random persistent planar graphs
</div>
</td></tr>
<tr><td><a href="Rand.P.html">P</a> [<a href="Rand.html">Rand</a>]</td>
<td><div class="info">
Random persistent graphs
</div>
</td></tr>
<tr><td><a href="Classic.P.html">P</a> [<a href="Classic.html">Classic</a>]</td>
<td><div class="info">
Classic Persistent Graphs
</div>
</td></tr>
<tr><td><a href="Builder.P.html">P</a> [<a href="Builder.html">Builder</a>]</td>
<td><div class="info">
Persistent Graphs Builders.
</div>
</td></tr>
<tr><td><a href="Pack.html">Pack</a> </td>
<td><div class="info">
<b>Immediate access to the library</b>: provides implementation of imperative
    graphs labeled with integer as well as algorithms on such graphs.
</div>
</td></tr>
<tr><td><a href="Dot.Parse.html">Parse</a> [<a href="Dot.html">Dot</a>]</td>
<td><div class="info">
Provide a parser for DOT file format.
</div>
</td></tr>
<tr><td><a href="Gml.Parse.html">Parse</a> [<a href="Gml.html">Gml</a>]</td>
<td><div class="info">
Provide a parser for GML file format.
</div>
</td></tr>
<tr><td><a href="Path.html">Path</a> </td>
<td><div class="info">
Paths
</div>
</td></tr>
<tr><td><a href="Sig_pack.S.PathCheck.html">PathCheck</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td>
<td><div class="info">
Path checking
</div>
</td></tr>
<tr><td><a href="Persistent.html">Persistent</a> </td>
<td><div class="info">
Persistent Graph Implementations.
</div>
</td></tr>
<tr><td><a href="Rand.Planar.html">Planar</a> [<a href="Rand.html">Rand</a>]</td>
<td></td></tr>
<tr><td><a href="Gml.Print.html">Print</a> [<a href="Gml.html">Gml</a>]</td>
<td><div class="info">
Provide a pretty-printer for GML file format.
</div>
</td></tr>
<tr><td align="left"><br>R</td></tr>
<tr><td><a href="Rand.html">Rand</a> </td>
<td><div class="info">
Random graph generation.
</div>
</td></tr>
<tr><td><a href="Sig_pack.S.Rand.html">Rand</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td>
<td><div class="info">
Random graphs
</div>
</td></tr>
<tr><td align="left"><br>S</td></tr>
<tr><td><a href="Delaunay.Triangulation.S.html">S</a> [<a href="Delaunay.Triangulation.html">Delaunay.Triangulation</a>]</td>
<td></td></tr>
<tr><td><a href="Sig.html">Sig</a> </td>
<td><div class="info">
<b>Signatures for graph implementations.</b>
</div>
</td></tr>
<tr><td><a href="Sig_pack.html">Sig_pack</a> </td>
<td><div class="info">
Immediate access to the library: contain a signature gathering an
    imperative graph signature and all algorithms.
</div>
</td></tr>
<tr><td><a href="Strat.html">Strat</a> </td>
<td><div class="info">
Strategies 
</div>
</td></tr>
<tr><td align="left"><br>T</td></tr>
<tr><td><a href="Topological.html">Topological</a> </td>
<td><div class="info">
Topological order.
</div>
</td></tr>
<tr><td><a href="Sig_pack.S.Topological.html">Topological</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td>
<td><div class="info">
Topological order
</div>
</td></tr>
<tr><td><a href="Traverse.html">Traverse</a> </td>
<td><div class="info">
Graph traversal.
</div>
</td></tr>
<tr><td align="left"><br>U</td></tr>
<tr><td><a href="Util.html">Util</a> </td>
<td><div class="info">
Some useful operations.
</div>
</td></tr>
<tr><td align="left"><br>V</td></tr>
<tr><td><a href="Strat.G.V.html">V</a> [<a href="Strat.G.html">Strat.G</a>]</td>
<td></td></tr>
<tr><td><a href="Minsep.G.V.html">V</a> [<a href="Minsep.G.html">Minsep.G</a>]</td>
<td></td></tr>
<tr><td><a href="Gmap.V_SRC.V.html">V</a> [<a href="Gmap.V_SRC.html">Gmap.V_SRC</a>]</td>
<td></td></tr>
<tr><td><a href="Gml.G.V.html">V</a> [<a href="Gml.G.html">Gml.G</a>]</td>
<td></td></tr>
<tr><td><a href="Flow.G_FORD_FULKERSON.V.html">V</a> [<a href="Flow.G_FORD_FULKERSON.html">Flow.G_FORD_FULKERSON</a>]</td>
<td></td></tr>
<tr><td><a href="Flow.G_GOLDBERG.V.html">V</a> [<a href="Flow.G_GOLDBERG.html">Flow.G_GOLDBERG</a>]</td>
<td></td></tr>
<tr><td><a href="Kruskal.G.V.html">V</a> [<a href="Kruskal.G.html">Kruskal.G</a>]</td>
<td></td></tr>
<tr><td><a href="Components.G.V.html">V</a> [<a href="Components.G.html">Components.G</a>]</td>
<td></td></tr>
<tr><td><a href="Topological.G.V.html">V</a> [<a href="Topological.G.html">Topological.G</a>]</td>
<td></td></tr>
<tr><td><a href="Coloring.GM.V.html">V</a> [<a href="Coloring.GM.html">Coloring.GM</a>]</td>
<td></td></tr>
<tr><td><a href="Coloring.G.V.html">V</a> [<a href="Coloring.G.html">Coloring.G</a>]</td>
<td></td></tr>
<tr><td><a href="Traverse.GM.V.html">V</a> [<a href="Traverse.GM.html">Traverse.GM</a>]</td>
<td></td></tr>
<tr><td><a href="Traverse.G.V.html">V</a> [<a href="Traverse.G.html">Traverse.G</a>]</td>
<td></td></tr>
<tr><td><a href="Path.G.V.html">V</a> [<a href="Path.G.html">Path.G</a>]</td>
<td></td></tr>
<tr><td><a href="Sig_pack.S.V.html">V</a> [<a href="Sig_pack.S.html">Sig_pack.S</a>]</td>
<td><div class="info">
Vertices
</div>
</td></tr>
<tr><td><a href="Sig.G.V.html">V</a> [<a href="Sig.G.html">Sig.G</a>]</td>
<td><div class="info">
Vertices have type <code class="code">V.t</code> and are labeled with type <code class="code">V.label</code>
      (note that an implementation may identify the vertex with its
      label)
</div>
</td></tr>
<tr><td><a href="Minsep.MINSEP.VSetset.html">VSetset</a> [<a href="Minsep.MINSEP.html">Minsep.MINSEP</a>]</td>
<td><div class="info">
Implementation of a set of <code class="code">Vertex_Set</code>
</div>
</td></tr>
<tr><td><a href="Gmap.Vertex.html">Vertex</a> [<a href="Gmap.html">Gmap</a>]</td>
<td><div class="info">
Provide a mapping function from a mapping of vertices.
</div>
</td></tr>
<tr><td><a href="Minsep.MINSEP.Vertex_Set.html">Vertex_Set</a> [<a href="Minsep.MINSEP.html">Minsep.MINSEP</a>]</td>
<td><div class="info">
Implementation of a set of vertex
</div>
</td></tr>
<tr><td><a href="Oper.Neighbourhood.Vertex_Set.html">Vertex_Set</a> [<a href="Oper.Neighbourhood.html">Oper.Neighbourhood</a>]</td>
<td></td></tr>
</table><br>
</body>
</html>