Sophie

Sophie

distrib > Fedora > 14 > i386 > by-pkgid > adda6cb03f7d04f28c3fac3fe1ef4d50 > files > 109

ocaml-ocamlgraph-devel-1.3-3.fc13.i686.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="Kruskal.html">
<link rel="next" href="Graphviz.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="Maximum flow algorithms" rel="Section" href="#1_Maximumflowalgorithms">
<link title="Goldberg maximal flow algorithm" rel="Subsection" href="#2_Goldbergmaximalflowalgorithm">
<link title="Ford-Fulkerson maximal flow algorithm" rel="Subsection" href="#2_FordFulkersonmaximalflowalgorithm">
<title>Flow</title>
</head>
<body>
<div class="navbar"><a href="Kruskal.html">Previous</a>
&nbsp;<a href="index.html">Up</a>
&nbsp;<a href="Graphviz.html">Next</a>
</div>
<center><h1>Module <a href="type_Flow.html">Flow</a></h1></center>
<br>
<pre><span class="keyword">module</span> Flow: <code class="code">sig</code> <a href="Flow.html">..</a> <code class="code">end</code></pre>Algorithms on flows 
<p>

    The following flow algorithms only apply to networks, that are
    directed graphs together with a source (a 0 in-degree vertex) and a 
    terminal (a 0 out-degree vertex).<br>
<hr width="100%">
<br>
<a name="1_Maximumflowalgorithms"></a>
<h1>Maximum flow algorithms</h1><br>
<pre><span class="keyword">module type</span> <a href="Flow.FLOW.html">FLOW</a> = <code class="code">sig</code> <a href="Flow.FLOW.html">..</a> <code class="code">end</code></pre><div class="info">
Signature for edges' flow.
</div>
<br>
<a name="2_Goldbergmaximalflowalgorithm"></a>
<h2>Goldberg maximal flow algorithm</h2><br>
<pre><span class="keyword">module type</span> <a href="Flow.G_GOLDBERG.html">G_GOLDBERG</a> = <code class="code">sig</code> <a href="Flow.G_GOLDBERG.html">..</a> <code class="code">end</code></pre><div class="info">
Minimal graph signature for Goldberg.
</div>
<pre><span class="keyword">module</span> <a href="Flow.Goldberg.html">Goldberg</a>: <div class="sig_block"><code class="code">functor (</code><code class="code">G</code><code class="code"> : </code><code class="type"><a href="Flow.G_GOLDBERG.html">G_GOLDBERG</a></code><code class="code">) -&gt; </code><div class="sig_block"><code class="code">functor (</code><code class="code">F</code><code class="code"> : </code><code class="type"><a href="Flow.FLOW.html">FLOW</a></code><code class="type">  with type label = G.E.label</code><code class="code">) -&gt; </code><code class="code">sig</code> <a href="Flow.Goldberg.html">..</a> <code class="code">end</code></div></div></pre><br>
<a name="2_FordFulkersonmaximalflowalgorithm"></a>
<h2>Ford-Fulkerson maximal flow algorithm</h2><br>
<pre><span class="keyword">module type</span> <a href="Flow.G_FORD_FULKERSON.html">G_FORD_FULKERSON</a> = <code class="code">sig</code> <a href="Flow.G_FORD_FULKERSON.html">..</a> <code class="code">end</code></pre><div class="info">
Minimal digraph signature for Ford-Fulkerson.
</div>
<pre><span class="keyword">module</span> <a href="Flow.Ford_Fulkerson.html">Ford_Fulkerson</a>: <div class="sig_block"><code class="code">functor (</code><code class="code">G</code><code class="code"> : </code><code class="type"><a href="Flow.G_FORD_FULKERSON.html">G_FORD_FULKERSON</a></code><code class="code">) -&gt; </code><div class="sig_block"><code class="code">functor (</code><code class="code">F</code><code class="code"> : </code><code class="type"><a href="Flow.FLOW.html">FLOW</a></code><code class="type">  with type label = G.E.label</code><code class="code">) -&gt; </code><code class="code">sig</code> <a href="Flow.Ford_Fulkerson.html">..</a> <code class="code">end</code></div></div></pre></body></html>