ocaml-containers/2.6/containers/CCGraph/Traverse/index.html
2019-06-18 23:01:25 -05:00

2 lines
No EOL
7 KiB
HTML
Raw Blame History

This file contains invisible Unicode characters

This file contains invisible Unicode characters that are indistinguishable to humans but may be processed differently by a computer. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

<!DOCTYPE html>
<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Traverse (containers.CCGraph.Traverse)</title><link rel="stylesheet" href="../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><script src="../../../highlight.pack.js"></script><script>hljs.initHighlightingOnLoad();</script></head><body><div class="content"><header><nav><a href="../index.html">Up</a> <a href="../../index.html">containers</a> &#x00BB; <a href="../index.html">CCGraph</a> &#x00BB; Traverse</nav><h1>Module <code>CCGraph.Traverse</code></h1></header><dl><dt class="spec type" id="type-path"><a href="#type-path" class="anchor"></a><code><span class="keyword">type</span> ('v, 'e) path</code><code> = (<span class="type-var">'v</span> * <span class="type-var">'e</span> * <span class="type-var">'v</span>) list</code></dt></dl><dl><dt class="spec value" id="val-generic"><a href="#val-generic" class="anchor"></a><code><span class="keyword">val</span> generic : tbl:<span class="type-var">'v</span> <a href="../index.html#type-set">set</a> <span>&#45;&gt;</span> bag:<span class="type-var">'v</span> <a href="../index.html#type-bag">bag</a> <span>&#45;&gt;</span> graph:(<span class="type-var">'v</span>, <span class="type-var">'e</span>) <a href="../index.html#type-t">t</a> <span>&#45;&gt;</span> <span class="type-var">'v</span> <a href="../index.html#type-sequence">sequence</a> <span>&#45;&gt;</span> <span class="type-var">'v</span> <a href="../index.html#type-sequence_once">sequence_once</a></code></dt><dd><p>Traversal of the given graph, starting from a sequence of vertices, using the given bag to choose the next vertex to explore. Each vertex is visited at most once.</p></dd></dl><dl><dt class="spec value" id="val-generic_tag"><a href="#val-generic_tag" class="anchor"></a><code><span class="keyword">val</span> generic_tag : tags:<span class="type-var">'v</span> <a href="../index.html#type-tag_set">tag_set</a> <span>&#45;&gt;</span> bag:<span class="type-var">'v</span> <a href="../index.html#type-bag">bag</a> <span>&#45;&gt;</span> graph:(<span class="type-var">'v</span>, <span class="type-var">'e</span>) <a href="../index.html#type-t">t</a> <span>&#45;&gt;</span> <span class="type-var">'v</span> <a href="../index.html#type-sequence">sequence</a> <span>&#45;&gt;</span> <span class="type-var">'v</span> <a href="../index.html#type-sequence_once">sequence_once</a></code></dt><dd><p>One-shot traversal of the graph using a tag set and the given bag.</p></dd></dl><dl><dt class="spec value" id="val-dfs"><a href="#val-dfs" class="anchor"></a><code><span class="keyword">val</span> dfs : tbl:<span class="type-var">'v</span> <a href="../index.html#type-set">set</a> <span>&#45;&gt;</span> graph:(<span class="type-var">'v</span>, <span class="type-var">'e</span>) <a href="../index.html#type-t">t</a> <span>&#45;&gt;</span> <span class="type-var">'v</span> <a href="../index.html#type-sequence">sequence</a> <span>&#45;&gt;</span> <span class="type-var">'v</span> <a href="../index.html#type-sequence_once">sequence_once</a></code></dt><dt class="spec value" id="val-dfs_tag"><a href="#val-dfs_tag" class="anchor"></a><code><span class="keyword">val</span> dfs_tag : tags:<span class="type-var">'v</span> <a href="../index.html#type-tag_set">tag_set</a> <span>&#45;&gt;</span> graph:(<span class="type-var">'v</span>, <span class="type-var">'e</span>) <a href="../index.html#type-t">t</a> <span>&#45;&gt;</span> <span class="type-var">'v</span> <a href="../index.html#type-sequence">sequence</a> <span>&#45;&gt;</span> <span class="type-var">'v</span> <a href="../index.html#type-sequence_once">sequence_once</a></code></dt><dt class="spec value" id="val-bfs"><a href="#val-bfs" class="anchor"></a><code><span class="keyword">val</span> bfs : tbl:<span class="type-var">'v</span> <a href="../index.html#type-set">set</a> <span>&#45;&gt;</span> graph:(<span class="type-var">'v</span>, <span class="type-var">'e</span>) <a href="../index.html#type-t">t</a> <span>&#45;&gt;</span> <span class="type-var">'v</span> <a href="../index.html#type-sequence">sequence</a> <span>&#45;&gt;</span> <span class="type-var">'v</span> <a href="../index.html#type-sequence_once">sequence_once</a></code></dt><dt class="spec value" id="val-bfs_tag"><a href="#val-bfs_tag" class="anchor"></a><code><span class="keyword">val</span> bfs_tag : tags:<span class="type-var">'v</span> <a href="../index.html#type-tag_set">tag_set</a> <span>&#45;&gt;</span> graph:(<span class="type-var">'v</span>, <span class="type-var">'e</span>) <a href="../index.html#type-t">t</a> <span>&#45;&gt;</span> <span class="type-var">'v</span> <a href="../index.html#type-sequence">sequence</a> <span>&#45;&gt;</span> <span class="type-var">'v</span> <a href="../index.html#type-sequence_once">sequence_once</a></code></dt><dt class="spec value" id="val-dijkstra"><a href="#val-dijkstra" class="anchor"></a><code><span class="keyword">val</span> dijkstra : tbl:<span class="type-var">'v</span> <a href="../index.html#type-set">set</a> <span>&#45;&gt;</span> ?&#8288;dist:(<span class="type-var">'e</span> <span>&#45;&gt;</span> int) <span>&#45;&gt;</span> graph:(<span class="type-var">'v</span>, <span class="type-var">'e</span>) <a href="../index.html#type-t">t</a> <span>&#45;&gt;</span> <span class="type-var">'v</span> <a href="../index.html#type-sequence">sequence</a> <span>&#45;&gt;</span> (<span class="type-var">'v</span> * int * (<span class="type-var">'v</span>, <span class="type-var">'e</span>) <a href="index.html#type-path">path</a>) <a href="../index.html#type-sequence_once">sequence_once</a></code></dt><dd><p>Dijkstra algorithm, traverses a graph in increasing distance order. Yields each vertex paired with its distance to the set of initial vertices (the smallest distance needed to reach the node from the initial vertices).</p><dl><dt>parameter dist</dt><dd><p>distance from origin of the edge to destination, must be strictly positive. Default is 1 for every edge.</p></dd></dl></dd></dl><dl><dt class="spec value" id="val-dijkstra_tag"><a href="#val-dijkstra_tag" class="anchor"></a><code><span class="keyword">val</span> dijkstra_tag : ?&#8288;dist:(<span class="type-var">'e</span> <span>&#45;&gt;</span> int) <span>&#45;&gt;</span> tags:<span class="type-var">'v</span> <a href="../index.html#type-tag_set">tag_set</a> <span>&#45;&gt;</span> graph:(<span class="type-var">'v</span>, <span class="type-var">'e</span>) <a href="../index.html#type-t">t</a> <span>&#45;&gt;</span> <span class="type-var">'v</span> <a href="../index.html#type-sequence">sequence</a> <span>&#45;&gt;</span> (<span class="type-var">'v</span> * int * (<span class="type-var">'v</span>, <span class="type-var">'e</span>) <a href="index.html#type-path">path</a>) <a href="../index.html#type-sequence_once">sequence_once</a></code></dt></dl><dl><dt class="spec module" id="module-Event"><a href="#module-Event" class="anchor"></a><code><span class="keyword">module</span> <a href="Event/index.html">Event</a> : <span class="keyword">sig</span> ... <span class="keyword">end</span></code></dt><dd></dd></dl></div></body></html>