<!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="Sig_pack.S.Marking.html">
<link rel="next" href="Sig_pack.S.Rand.html">
<link rel="Up" href="Sig_pack.S.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>Sig_pack.S.Classic</title>
</head>
<body>
<div class="navbar"><a href="Sig_pack.S.Marking.html">Previous</a>
<a href="Sig_pack.S.html">Up</a>
<a href="Sig_pack.S.Rand.html">Next</a>
</div>
<center><h1>Module <a href="type_Sig_pack.S.Classic.html">Sig_pack.S.Classic</a></h1></center>
<br>
<pre><span class="keyword">module</span> Classic: <code class="code">sig</code> <a href="Sig_pack.S.Classic.html">..</a> <code class="code">end</code></pre>Classic graphs<br>
<hr width="100%">
<pre><span class="keyword">val</span> <a name="VALdivisors"></a>divisors : <code class="type">int -> <a href="Sig_pack.S.html#TYPEt">Sig_pack.S.t</a></code></pre><div class="info">
<code class="code">divisors n</code> builds the graph of divisors.
Vertices are integers from <code class="code">2</code> to <code class="code">n</code>. <code class="code">i</code> is connected to <code class="code">j</code> if
and only if <code class="code">i</code> divides <code class="code">j</code>.<br>
<b>Raises</b> <code>Invalid_argument</code> is <code class="code">n < 2</code>.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALde_bruijn"></a>de_bruijn : <code class="type">int -> <a href="Sig_pack.S.html#TYPEt">Sig_pack.S.t</a></code></pre><div class="info">
<code class="code">de_bruijn n</code> builds the de Bruijn graph of order <code class="code">n</code>.
Vertices are bit sequences of length <code class="code">n</code> (encoded as their
interpretation as binary integers). The sequence <code class="code">xw</code> is connected
to the sequence <code class="code">wy</code> for any bits <code class="code">x</code> and <code class="code">y</code> and any bit sequence
<code class="code">w</code> of length <code class="code">n-1</code>.<br>
<b>Raises</b> <code>Invalid_argument</code> is <code class="code">n < 1</code> or <code class="code">n > Sys.word_size-1</code>.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALvertex_only"></a>vertex_only : <code class="type">int -> <a href="Sig_pack.S.html#TYPEt">Sig_pack.S.t</a></code></pre><div class="info">
<code class="code">vertex_only n</code> builds a graph with <code class="code">n</code> vertices and no edge.<br>
</div>
<pre><span class="keyword">val</span> <a name="VALfull"></a>full : <code class="type">?self:bool -> int -> <a href="Sig_pack.S.html#TYPEt">Sig_pack.S.t</a></code></pre><div class="info">
<code class="code">full n</code> builds a graph with <code class="code">n</code> vertices and all possible edges.
The optional argument <code class="code">self</code> indicates if loop edges should be added
(default value is <code class="code">true</code>).<br>
</div>
</body></html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
1280a9d763ea6574bb6098d1ca3767c9
>
files
>
165
