<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 module types</title> </head> <body> <center><h1>Index of module types</h1></center> <table> <tr><td align="left"><br>A</td></tr> <tr><td><a href="Sig.ANY_TYPE.html">ANY_TYPE</a> [<a href="Sig.html">Sig</a>]</td> <td><div class="info"> Signature with only an abstract type. </div> </td></tr> <tr><td><a href="Graphviz.ATTRIBUTES.html">ATTRIBUTES</a> [<a href="Graphviz.html">Graphviz</a>]</td> <td><div class="info"> The <code class="code">ATTRIBUTES</code> module type defines the interface for the engines. </div> </td></tr> <tr><td align="left"><br>C</td></tr> <tr><td><a href="Delaunay.CCC.html">CCC</a> [<a href="Delaunay.html">Delaunay</a>]</td> <td><div class="info"> Delaunay triangulation is available for any CCC system in the sense of Knuth's ``Axioms and Hulls'' </div> </td></tr> <tr><td><a href="Sig.COMPARABLE.html">COMPARABLE</a> [<a href="Sig.html">Sig</a>]</td> <td><div class="info"> Signature merging <a href="Sig.ORDERED_TYPE.html"><code class="code">Sig.ORDERED_TYPE</code></a> and <a href="Sig.HASHABLE.html"><code class="code">Sig.HASHABLE</code></a>. </div> </td></tr> <tr><td align="left"><br>E</td></tr> <tr><td><a href="Sig.EDGE.html">EDGE</a> [<a href="Sig.html">Sig</a>]</td> <td><div class="info"> Signature for edges. </div> </td></tr> <tr><td><a href="Gmap.E_DST.html">E_DST</a> [<a href="Gmap.html">Gmap</a>]</td> <td><div class="info"> Signature for the destination graph. </div> </td></tr> <tr><td><a href="Gmap.E_SRC.html">E_SRC</a> [<a href="Gmap.html">Gmap</a>]</td> <td><div class="info"> Signature for the source graph. </div> </td></tr> <tr><td align="left"><br>F</td></tr> <tr><td><a href="Flow.FLOW.html">FLOW</a> [<a href="Flow.html">Flow</a>]</td> <td><div class="info"> Signature for edges' flow. </div> </td></tr> <tr><td align="left"><br>G</td></tr> <tr><td><a href="Strat.G.html">G</a> [<a href="Strat.html">Strat</a>]</td> <td><div class="info"> Signature for graphs </div> </td></tr> <tr><td><a href="Minsep.G.html">G</a> [<a href="Minsep.html">Minsep</a>]</td> <td><div class="info"> Minimal signature for computing the minimal separators </div> </td></tr> <tr><td><a href="Gml.G.html">G</a> [<a href="Gml.html">Gml</a>]</td> <td><div class="info"> Signature for graph required by <a href="Gml.Print.html"><code class="code">Gml.Print</code></a>. </div> </td></tr> <tr><td><a href="Kruskal.G.html">G</a> [<a href="Kruskal.html">Kruskal</a>]</td> <td><div class="info"> Minimal graph signature for Kruskal. </div> </td></tr> <tr><td><a href="Components.G.html">G</a> [<a href="Components.html">Components</a>]</td> <td><div class="info"> Minimal graph signature required by <a href="Components.Make.html"><code class="code">Components.Make</code></a>. </div> </td></tr> <tr><td><a href="Topological.G.html">G</a> [<a href="Topological.html">Topological</a>]</td> <td><div class="info"> Minimal graph signature to provide. </div> </td></tr> <tr><td><a href="Coloring.G.html">G</a> [<a href="Coloring.html">Coloring</a>]</td> <td><div class="info"> Minimal graph signature for <a href="Coloring.Make.html"><code class="code">Coloring.Make</code></a>. </div> </td></tr> <tr><td><a href="Traverse.G.html">G</a> [<a href="Traverse.html">Traverse</a>]</td> <td><div class="info"> Minimal graph signature for <a href="Traverse.Dfs.html"><code class="code">Traverse.Dfs</code></a> and <a href="Traverse.Bfs.html"><code class="code">Traverse.Bfs</code></a>. </div> </td></tr> <tr><td><a href="Path.G.html">G</a> [<a href="Path.html">Path</a>]</td> <td><div class="info"> Minimal graph signature for Dijkstra's algorithm. </div> </td></tr> <tr><td><a href="Sig.G.html">G</a> [<a href="Sig.html">Sig</a>]</td> <td><div class="info"> Common signature for all graphs. </div> </td></tr> <tr><td><a href="Coloring.GM.html">GM</a> [<a href="Coloring.html">Coloring</a>]</td> <td><div class="info"> Minimal graph signature for <a href="Coloring.GM.Mark.html"><code class="code">Coloring.GM.Mark</code></a>. </div> </td></tr> <tr><td><a href="Traverse.GM.html">GM</a> [<a href="Traverse.html">Traverse</a>]</td> <td><div class="info"> Minimal graph signature for graph traversal with marking. </div> </td></tr> <tr><td><a href="Flow.G_FORD_FULKERSON.html">G_FORD_FULKERSON</a> [<a href="Flow.html">Flow</a>]</td> <td><div class="info"> Minimal digraph signature for Ford-Fulkerson. </div> </td></tr> <tr><td><a href="Flow.G_GOLDBERG.html">G_GOLDBERG</a> [<a href="Flow.html">Flow</a>]</td> <td><div class="info"> Minimal graph signature for Goldberg. </div> </td></tr> <tr><td align="left"><br>H</td></tr> <tr><td><a href="Sig.HASHABLE.html">HASHABLE</a> [<a href="Sig.html">Sig</a>]</td> <td><div class="info"> Signature equivalent to <code class="code">Hashtbl.HashedType</code>. </div> </td></tr> <tr><td align="left"><br>I</td></tr> <tr><td><a href="Sig.I.html">I</a> [<a href="Sig.html">Sig</a>]</td> <td><div class="info"> Signature for imperative (i.e. </div> </td></tr> <tr><td><a href="Sig.IM.html">IM</a> [<a href="Sig.html">Sig</a>]</td> <td><div class="info"> Signature for imperative graphs with marks on vertices. </div> </td></tr> <tr><td><a href="Builder.INT.html">INT</a> [<a href="Builder.html">Builder</a>]</td> <td></td></tr> <tr><td align="left"><br>M</td></tr> <tr><td><a href="Sig.MARK.html">MARK</a> [<a href="Sig.html">Sig</a>]</td> <td><div class="info"> Signature for marks on vertices. </div> </td></tr> <tr><td><a href="Minsep.MINSEP.html">MINSEP</a> [<a href="Minsep.html">Minsep</a>]</td> <td></td></tr> <tr><td align="left"><br>O</td></tr> <tr><td><a href="Sig.ORDERED_TYPE.html">ORDERED_TYPE</a> [<a href="Sig.html">Sig</a>]</td> <td><div class="info"> Signature equivalent to <code class="code">Set.OrderedType</code>. </div> </td></tr> <tr><td><a href="Sig.ORDERED_TYPE_DFT.html">ORDERED_TYPE_DFT</a> [<a href="Sig.html">Sig</a>]</td> <td><div class="info"> Signature equivalent to <code class="code">Set.OrderedType</code> with a default value. </div> </td></tr> <tr><td align="left"><br>P</td></tr> <tr><td><a href="Sig.P.html">P</a> [<a href="Sig.html">Sig</a>]</td> <td><div class="info"> Signature for persistent (i.e. </div> </td></tr> <tr><td><a href="Strat.PLAYER.html">PLAYER</a> [<a href="Strat.html">Strat</a>]</td> <td><div class="info"> Signature for graph add-ons: an initial vertex, final vertices and membership of vertices to either true or false, i.e. </div> </td></tr> <tr><td align="left"><br>S</td></tr> <tr><td><a href="Oper.S.html">S</a> [<a href="Oper.html">Oper</a>]</td> <td></td></tr> <tr><td><a href="Rand.S.html">S</a> [<a href="Rand.html">Rand</a>]</td> <td></td></tr> <tr><td><a href="Rand.Planar.S.html">S</a> [<a href="Rand.Planar.html">Rand.Planar</a>]</td> <td></td></tr> <tr><td><a href="Classic.S.html">S</a> [<a href="Classic.html">Classic</a>]</td> <td></td></tr> <tr><td><a href="Builder.S.html">S</a> [<a href="Builder.html">Builder</a>]</td> <td></td></tr> <tr><td><a href="Imperative.S.html">S</a> [<a href="Imperative.html">Imperative</a>]</td> <td><div class="info"> Signature of imperative graphs. </div> </td></tr> <tr><td><a href="Imperative.Matrix.S.html">S</a> [<a href="Imperative.Matrix.html">Imperative.Matrix</a>]</td> <td></td></tr> <tr><td><a href="Persistent.S.html">S</a> [<a href="Persistent.html">Persistent</a>]</td> <td><div class="info"> Signature of persistent graphs. </div> </td></tr> <tr><td><a href="Sig_pack.S.html">S</a> [<a href="Sig_pack.html">Sig_pack</a>]</td> <td><div class="info"> Signature gathering an imperative graph signature and all algorithms. </div> </td></tr> <tr><td><a href="Strat.STRAT.html">STRAT</a> [<a href="Strat.html">Strat</a>]</td> <td><div class="info"> Signature for strategies: for a given state, the strategy tells which state to go to </div> </td></tr> <tr><td align="left"><br>T</td></tr> <tr><td><a href="Delaunay.Triangulation.html">Triangulation</a> [<a href="Delaunay.html">Delaunay</a>]</td> <td><div class="info"> The result of triangulation is an abstract value of type <code class="code">triangulation</code>. </div> </td></tr> <tr><td align="left"><br>U</td></tr> <tr><td><a href="Kruskal.UNIONFIND.html">UNIONFIND</a> [<a href="Kruskal.html">Kruskal</a>]</td> <td><div class="info"> Signature of union-find. </div> </td></tr> <tr><td align="left"><br>V</td></tr> <tr><td><a href="Sig.VERTEX.html">VERTEX</a> [<a href="Sig.html">Sig</a>]</td> <td><div class="info"> Signature for vertices. </div> </td></tr> <tr><td><a href="Gmap.V_DST.html">V_DST</a> [<a href="Gmap.html">Gmap</a>]</td> <td><div class="info"> Signature for the destination graph. </div> </td></tr> <tr><td><a href="Gmap.V_SRC.html">V_SRC</a> [<a href="Gmap.html">Gmap</a>]</td> <td><div class="info"> Signature for the source graph. </div> </td></tr> <tr><td align="left"><br>W</td></tr> <tr><td><a href="Path.WEIGHT.html">WEIGHT</a> [<a href="Path.html">Path</a>]</td> <td><div class="info"> Signature for edges' weights. </div> </td></tr> </table><br> </body> </html>