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="Minsep.P.html">
<link rel="Up" href="Minsep.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.I</title>
</head>
<body>
<div class="navbar"><a href="Minsep.P.html">Previous</a>
&nbsp;<a href="Minsep.html">Up</a>
&nbsp;</div>
<center><h1>Functor <a href="type_Minsep.I.html">Minsep.I</a></h1></center>
<br>
<pre><span class="keyword">module</span> I: <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>Implementation for an imperative graph.
  Less efficient that the implementation for a persistent graph<br>
<table border="0" cellpadding="3" width="100%">
<tr>
<td align="left" valign="top" width="1%%"><b>Parameters: </b></td>
<td>
<table class="paramstable">
<tr>
<td align="center" valign="top" width="15%">
<code>G</code></td>
<td align="center" valign="top">:</td>
<td><code class="type">sig 
	   include G 
	   module Mark : <a href="Sig.MARK.html">Sig.MARK</a> with type graph = t and type vertex = V.t
	 end</code>
</table>
</td>
</tr>
</table>
<hr width="100%">
<pre><span class="keyword">module</span> <a href="Minsep.MINSEP.G.html">G</a>: <code class="type"><a href="Minsep.G.html">Minsep.G</a></code><code class="type"> </code></pre><div class="info">
Implementation of a graph
</div>
<pre><span class="keyword">module</span> <a href="Minsep.MINSEP.Vertex_Set.html">Vertex_Set</a>: <code class="type">Set.S</code><code class="type">  with type elt = G.V.t</code></pre><div class="info">
Implementation of a set of vertex
</div>
<pre><span class="keyword">module</span> <a href="Minsep.MINSEP.VSetset.html">VSetset</a>: <code class="type">Set.S</code><code class="type">  with type elt = Vertex_Set.t</code></pre><div class="info">
Implementation of a set of <code class="code">Vertex_Set</code>
</div>
<pre><span class="keyword">val</span> <a name="VALallminsep"></a>allminsep : <code class="type"><a href="Minsep.G.html#TYPEt">Minsep.G.t</a> -> Vertex_Set.t list</code></pre><div class="info">
<code class="code">allminsep g</code> computes the list of all minimal separators of g.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALlist_of_allminsep"></a>list_of_allminsep : <code class="type"><a href="Minsep.G.html#TYPEt">Minsep.G.t</a> -> G.V.t list list</code></pre><div class="info">
Less efficient that <code class="code">allminsep</code><br>
</div>
<pre><span class="keyword">val</span> <a name="VALset_of_allminsep"></a>set_of_allminsep : <code class="type"><a href="Minsep.G.html#TYPEt">Minsep.G.t</a> -> VSetset.t</code></pre><div class="info">
Less efficient that <code class="code">allminsep</code><br>
</div>
</body></html>