<!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="Up" href="Components.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>Components.Make</title>
</head>
<body>
<div class="navbar"> <a href="Components.html">Up</a>
</div>
<center><h1>Functor <a href="type_Components.Make.html">Components.Make</a></h1></center>
<br>
<pre><span class="keyword">module</span> Make: <div class="sig_block"><code class="code">functor (</code><code class="code">G</code><code class="code"> : </code><code class="type"><a href="Components.G.html">G</a></code><code class="code">) -> </code><code class="code">sig</code> <a href="Components.Make.html">..</a> <code class="code">end</code></div></pre>Functor providing functions to compute strongly connected components of a
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"><a href="Components.G.html">G</a></code>
</table>
</td>
</tr>
</table>
<hr width="100%">
<pre><span class="keyword">val</span> <a name="VALscc"></a>scc : <code class="type"><a href="Components.G.html#TYPEt">Components.G.t</a> -> int * (G.V.t -> int)</code></pre><div class="info">
<code class="code">scc g</code> computes the strongly connected components of <code class="code">g</code>.
The result is a pair <code class="code">(n,f)</code> where <code class="code">n</code> is the number of
components. Components are numbered from <code class="code">0</code> to <code class="code">n-1</code>, and
<code class="code">f</code> is a function mapping each vertex to its component
number. In particular, <code class="code">f u = f v</code> if and only if <code class="code">u</code> and
<code class="code">v</code> are in the same component. Another property of the
numbering is that components are numbered in a topological
order: if there is an arc from <code class="code">u</code> to <code class="code">v</code>, then <code class="code">f u >= f u</code><br>
</div>
<pre><span class="keyword">val</span> <a name="VALscc_array"></a>scc_array : <code class="type"><a href="Components.G.html#TYPEt">Components.G.t</a> -> G.V.t list array</code></pre><div class="info">
<code class="code">scc_array</code> computes the strongly connected components of <code class="code">g</code>.
Components are stored in the resulting array, indexed with a
numbering with the same properties as for <code class="code">scc</code> above.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALscc_list"></a>scc_list : <code class="type"><a href="Components.G.html#TYPEt">Components.G.t</a> -> G.V.t list list</code></pre><div class="info">
<code class="code">scc_list</code> computes the strongly connected components of <code class="code">g</code>.
The result is a partition of the set of the vertices of <code class="code">g</code>.<br>
</div>
</body></html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
1280a9d763ea6574bb6098d1ca3767c9
>
files
>
30
