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

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

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<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 rel="previous" href="Gmap.html">
<link rel="next" href="Cliquetree.html">
<link rel="Up" 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>Minsep</title>
</head>
<body>
<div class="navbar"><a href="Gmap.html">Previous</a>
&nbsp;<a href="index.html">Up</a>
&nbsp;<a href="Cliquetree.html">Next</a>
</div>
<center><h1>Module <a href="type_Minsep.html">Minsep</a></h1></center>
<br>
<pre><span class="keyword">module</span> Minsep: <code class="code">sig</code> <a href="Minsep.html">..</a> <code class="code">end</code></pre>Minimal separators of a graph
<p>

  Based on the article:
  Generating all the minimal separators of a graph.
  by A. Berry, J.-P. Bordat and O.Cogis
  http://www.isima.fr/berry/generating.html
<p>

  A set <code class="code">S</code> of vertices is a minimal separator if it exists 2 distinct
  connected components <code class="code">C</code> and <code class="code">D</code> in <code class="code">G \ S</code> such that each vertex of <code class="code">S</code> has
  a successor in <code class="code">C</code> and <code class="code">D</code>.<br>
<hr width="100%">
<pre><span class="keyword">module type</span> <a href="Minsep.G.html">G</a> = <code class="code">sig</code> <a href="Minsep.G.html">..</a> <code class="code">end</code></pre><div class="info">
Minimal signature for computing the minimal separators
</div>
<pre><span class="keyword">module type</span> <a href="Minsep.MINSEP.html">MINSEP</a> = <code class="code">sig</code> <a href="Minsep.MINSEP.html">..</a> <code class="code">end</code></pre><pre><span class="keyword">module</span> <a href="Minsep.P.html">P</a>: <div class="sig_block"><code class="code">functor (</code><code class="code">G</code><code class="code"> : </code><code class="code">sig</code><div class="sig_block"><pre><span class="keyword">include</span> Minsep.G</pre>
<pre><span class="keyword">val</span> <a name="VALremove_vertex"></a>remove_vertex : <code class="type">t -> V.t -> t</code></pre></div><code class="code">end</code><code class="code">) -&gt; </code><code class="type"><a href="Minsep.MINSEP.html">MINSEP</a></code><code class="type">  with module G = G</code></div></pre><div class="info">
Implementation for a persistent graph
</div>
<pre><span class="keyword">module</span> <a href="Minsep.I.html">I</a>: <div class="sig_block"><code class="code">functor (</code><code class="code">G</code><code class="code"> : </code><code class="code">sig</code><div class="sig_block"><pre><span class="keyword">include</span> Minsep.G</pre>
<pre><span class="keyword">module</span> <a href="Minsep.I.Mark.html">Mark</a>: <code class="type"><a href="Sig.MARK.html">Sig.MARK</a></code><code class="type">  with type graph = t and type vertex = V.t</code></pre></div><code class="code">end</code><code class="code">) -&gt; </code><code class="type"><a href="Minsep.MINSEP.html">MINSEP</a></code><code class="type">  with module G = G</code></div></pre><div class="info">
Implementation for an imperative graph.
</div>
</body></html>