<!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="Components.html">
<link rel="next" href="Flow.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"><link title="Generic version where union-find implementation is provided" rel="Section" href="#2_Genericversionwhereunionfindimplementationisprovided">
<title>Kruskal</title>
</head>
<body>
<div class="navbar"><a href="Components.html">Previous</a>
<a href="index.html">Up</a>
<a href="Flow.html">Next</a>
</div>
<center><h1>Module <a href="type_Kruskal.html">Kruskal</a></h1></center>
<br>
<pre><span class="keyword">module</span> Kruskal: <code class="code">sig</code> <a href="Kruskal.html">..</a> <code class="code">end</code></pre>Kruskal's algorithm.<br>
<hr width="100%">
<pre><span class="keyword">module type</span> <a href="Kruskal.G.html">G</a> = <code class="code">sig</code> <a href="Kruskal.G.html">..</a> <code class="code">end</code></pre><div class="info">
Minimal graph signature for Kruskal.
</div>
<pre><span class="keyword">module</span> <a href="Kruskal.Make.html">Make</a>: <div class="sig_block"><code class="code">functor (</code><code class="code">G</code><code class="code"> : </code><code class="type"><a href="Kruskal.G.html">G</a></code><code class="code">) -> </code><div class="sig_block"><code class="code">functor (</code><code class="code">W</code><code class="code"> : </code><code class="type"><a href="Sig.ORDERED_TYPE.html">Sig.ORDERED_TYPE</a></code><code class="type"> with type t = G.E.label</code><code class="code">) -> </code><code class="code">sig</code> <a href="Kruskal.Make.html">..</a> <code class="code">end</code></div></div></pre><div class="info">
Functor providing an implementation of the Kruskal's algorithm computing
spanning trees.
</div>
<br>
<a name="2_Genericversionwhereunionfindimplementationisprovided"></a>
<h2>Generic version where union-find implementation is provided</h2><br>
<pre><span class="keyword">module type</span> <a href="Kruskal.UNIONFIND.html">UNIONFIND</a> = <code class="code">sig</code> <a href="Kruskal.UNIONFIND.html">..</a> <code class="code">end</code></pre><div class="info">
Signature of union-find.
</div>
<pre><span class="keyword">module</span> <a href="Kruskal.Generic.html">Generic</a>: <div class="sig_block"><code class="code">functor (</code><code class="code">G</code><code class="code"> : </code><code class="type"><a href="Kruskal.G.html">G</a></code><code class="code">) -> </code><div class="sig_block"><code class="code">functor (</code><code class="code">W</code><code class="code"> : </code><code class="type"><a href="Sig.ORDERED_TYPE.html">Sig.ORDERED_TYPE</a></code><code class="type"> with type t = G.E.label</code><code class="code">) -> </code><div class="sig_block"><code class="code">functor (</code><code class="code">UF</code><code class="code"> : </code><code class="type"><a href="Kruskal.UNIONFIND.html">UNIONFIND</a></code><code class="type"> with type elt = G.V.t</code><code class="code">) -> </code><code class="code">sig</code> <a href="Kruskal.Generic.html">..</a> <code class="code">end</code></div></div></div></pre><div class="info">
Functor providing an implementation of the Kruskal's algorithm computing
spanning trees using an user-defined union-find algorithm.
</div>
</body></html>
