Sophie: ocaml-ocamlgraph-doc-1.1-1mdv2010.0 i586

ocaml-ocamlgraph-doc-1.1-1mdv2010.0.i586.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="next" href="Path.Check.html">
<link rel="Up" href="Path.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>Path.Dijkstra</title>
</head>
<body>
<div class="navbar">&nbsp;<a href="Path.html">Up</a>
&nbsp;<a href="Path.Check.html">Next</a>
</div>
<center><h1>Functor <a href="type_Path.Dijkstra.html">Path.Dijkstra</a></h1></center>
<br>
<pre><span class="keyword">module</span> Dijkstra: <div class="sig_block"><code class="code">functor (</code><code class="code">G</code><code class="code"> : </code><code class="type"><a href="Path.G.html">G</a></code><code class="code">) -&gt; </code><div class="sig_block"><code class="code">functor (</code><code class="code">W</code><code class="code"> : </code><code class="type"><a href="Path.WEIGHT.html">WEIGHT</a></code><code class="type">  with type label = G.E.label</code><code class="code">) -&gt; </code><code class="code">sig</code> <a href="Path.Dijkstra.html">..</a> <code class="code">end</code></div></div></pre><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="Path.G.html">G</a></code>
<tr>
<td align="center" valign="top" width="15%">
<code>W</code></td>
<td align="center" valign="top">:</td>
<td><code class="type">WEIGHT with type label = G.E.label</code>
</table>
</td>
</tr>
</table>
<hr width="100%">
<pre><span class="keyword">val</span> <a name="VALshortest_path"></a>shortest_path : <code class="type"><a href="Path.G.html#TYPEt">Path.G.t</a> -> G.V.t -> G.V.t -> <a href="Path.G.E.html#TYPEt">Path.G.E.t</a> list * W.t</code></pre><div class="info">
<code class="code">shortest_path g v1 v2</code> computes the shortest path from vertex <code class="code">v1</code>
      to vertex <code class="code">v2</code> in graph <code class="code">g</code>. The path is returned as the list of 
      followed edges, together with the total length of the path. 
      raise <code class="code">Not_found</code> if the path from <code class="code">v1</code> to <code class="code">v2</code> does not exist. 
<p>

      Complexity: at most O((V+E)log(V))<br>
</div>
</body></html>