<!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="Oper.Choose.html"> <link rel="Up" href="Oper.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>Oper.Neighbourhood</title> </head> <body> <div class="navbar"><a href="Oper.Choose.html">Previous</a> <a href="Oper.html">Up</a> </div> <center><h1>Functor <a href="type_Oper.Neighbourhood.html">Oper.Neighbourhood</a></h1></center> <br> <pre><span class="keyword">module</span> Neighbourhood: <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">type</span> <a name="TYPEt"></a><code class="type"></code>t </pre> <pre><span class="keyword">module</span> <a href="Oper.Neighbourhood.V.html">V</a>: <code class="type"><a href="Sig.COMPARABLE.html">Sig.COMPARABLE</a></code><code class="type"> </code></pre><pre><span class="keyword">val</span> <a name="VALfold_succ"></a>fold_succ : <code class="type">(V.t -> 'a -> 'a) -> t -> V.t -> 'a -> 'a</code></pre><pre><span class="keyword">val</span> <a name="VALsucc"></a>succ : <code class="type">t -> V.t -> V.t list</code></pre></div><code class="code">end</code><code class="code">) -> </code><code class="code">sig</code> <a href="Oper.Neighbourhood.html">..</a> <code class="code">end</code></div></pre>Neighbourhood of vertex / vertices<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 type t module V : <a href="Sig.COMPARABLE.html">Sig.COMPARABLE</a> val fold_succ: (V.t -> 'a -> 'a) -> t -> V.t -> 'a -> 'a val succ: t -> V.t -> V.t list end</code> </table> </td> </tr> </table> <hr width="100%"> <pre><span class="keyword">module</span> <a href="Oper.Neighbourhood.Vertex_Set.html">Vertex_Set</a>: <code class="type">Set.S</code><code class="type"> with type elt = G.V.t</code></pre><br> The neighbourhood of a vertex <code class="code">v</code> is { v' | (succ g v) and (v <> v') }<br> <pre><span class="keyword">val</span> <a name="VALlist_from_vertex"></a>list_from_vertex : <code class="type">G.t -> G.V.t -> G.V.t list</code></pre><div class="info"> Neighbourhood of a vertex as a list.<br> </div> <pre><span class="keyword">val</span> <a name="VALset_from_vertex"></a>set_from_vertex : <code class="type">G.t -> G.V.t -> Vertex_Set.t</code></pre><div class="info"> Neighbourhood of a vertex as a set. Less efficient that <code class="code">list_from_vertex</code>.<br> </div> <br> The neighbourhood of a set <code class="code">S</code> of vertices is <code class="code">U \ S</code> where <code class="code">U</code> is the union of neighbourhoods of each vertex of <code class="code">S</code>.<br> <pre><span class="keyword">val</span> <a name="VALlist_from_vertices"></a>list_from_vertices : <code class="type">G.t -> G.V.t list -> G.V.t list</code></pre><div class="info"> Neighbourhood of a list of vertices as a list.<br> </div> <pre><span class="keyword">val</span> <a name="VALset_from_vertices"></a>set_from_vertices : <code class="type">G.t -> G.V.t list -> Vertex_Set.t</code></pre><div class="info"> Neighbourhood of a list of vertices as a set. More efficient that <code class="code">list_from_vertices</code>.<br> </div> </body></html>