/usr/share/doc/libghc-fgl-doc/html/Data-Graph-Inductive-Query-GVD.html is in libghc-fgl-doc 5.5.4.0-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 | <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Data.Graph.Inductive.Query.GVD</title><link href="ocean.css" rel="stylesheet" type="text/css" title="Ocean" /><script src="haddock-util.js" type="text/javascript"></script><script src="file:///usr/share/javascript/mathjax/MathJax.js" type="text/javascript"></script><script type="text/javascript">//<![CDATA[
window.onload = function () {pageLoad();setSynopsis("mini_Data-Graph-Inductive-Query-GVD.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="src/Data-Graph-Inductive-Query-GVD.html">Source</a></li><li><a href="index.html">Contents</a></li><li><a href="doc-index.html">Index</a></li></ul><p class="caption">fgl-5.5.4.0: Martin Erwig's Functional Graph Library</p></div><div id="content"><div id="module-header"><table class="info"><tr><th>Safe Haskell</th><td>Safe</td></tr><tr><th>Language</th><td>Haskell98</td></tr></table><p class="caption">Data.Graph.Inductive.Query.GVD</p></div><div id="description"><p class="caption">Description</p><div class="doc"><p>Graph Voronoi Diagram</p><p>These functions can be used to create a <em>shortest path forest</em>
where the roots are specified.</p></div></div><div id="synopsis"><p id="control.syn" class="caption expander" onclick="toggleSection('syn')">Synopsis</p><ul id="section.syn" class="hide" onclick="toggleSection('syn')"><li class="src short"><span class="keyword">type</span> <a href="#t:Voronoi">Voronoi</a> a = <a href="Data-Graph-Inductive-Query-GVD.html#t:LRTree">LRTree</a> a</li><li class="src short"><span class="keyword">type</span> <a href="#t:LRTree">LRTree</a> a = [<a href="Data-Graph-Inductive-Graph.html#t:LPath">LPath</a> a]</li><li class="src short"><a href="#v:gvdIn">gvdIn</a> :: (<a href="Data-Graph-Inductive-Graph.html#t:DynGraph">DynGraph</a> gr, <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.1.0/Prelude.html#t:Real">Real</a> b) => [<a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a>] -> gr a b -> <a href="Data-Graph-Inductive-Query-GVD.html#t:Voronoi">Voronoi</a> b</li><li class="src short"><a href="#v:gvdOut">gvdOut</a> :: (<a href="Data-Graph-Inductive-Graph.html#t:Graph">Graph</a> gr, <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.1.0/Prelude.html#t:Real">Real</a> b) => [<a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a>] -> gr a b -> <a href="Data-Graph-Inductive-Query-GVD.html#t:Voronoi">Voronoi</a> b</li><li class="src short"><a href="#v:voronoiSet">voronoiSet</a> :: <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a> -> <a href="Data-Graph-Inductive-Query-GVD.html#t:Voronoi">Voronoi</a> b -> [<a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a>]</li><li class="src short"><a href="#v:nearestNode">nearestNode</a> :: <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a> -> <a href="Data-Graph-Inductive-Query-GVD.html#t:Voronoi">Voronoi</a> b -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.1.0/Data-Maybe.html#t:Maybe">Maybe</a> <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a></li><li class="src short"><a href="#v:nearestDist">nearestDist</a> :: <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a> -> <a href="Data-Graph-Inductive-Query-GVD.html#t:Voronoi">Voronoi</a> b -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.1.0/Data-Maybe.html#t:Maybe">Maybe</a> b</li><li class="src short"><a href="#v:nearestPath">nearestPath</a> :: <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a> -> <a href="Data-Graph-Inductive-Query-GVD.html#t:Voronoi">Voronoi</a> b -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.1.0/Data-Maybe.html#t:Maybe">Maybe</a> <a href="Data-Graph-Inductive-Graph.html#t:Path">Path</a></li></ul></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src"><span class="keyword">type</span> <a id="t:Voronoi" class="def">Voronoi</a> a = <a href="Data-Graph-Inductive-Query-GVD.html#t:LRTree">LRTree</a> a <a href="src/Data-Graph-Inductive-Query-GVD.html#Voronoi" class="link">Source</a> <a href="#t:Voronoi" class="selflink">#</a></p><div class="doc"><p>Representation of a shortest path forest.</p></div></div><div class="top"><p class="src"><span class="keyword">type</span> <a id="t:LRTree" class="def">LRTree</a> a = [<a href="Data-Graph-Inductive-Graph.html#t:LPath">LPath</a> a] <a href="src/Data-Graph-Inductive-Internal-RootPath.html#LRTree" class="link">Source</a> <a href="#t:LRTree" class="selflink">#</a></p></div><div class="top"><p class="src"><a id="v:gvdIn" class="def">gvdIn</a> :: (<a href="Data-Graph-Inductive-Graph.html#t:DynGraph">DynGraph</a> gr, <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.1.0/Prelude.html#t:Real">Real</a> b) => [<a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a>] -> gr a b -> <a href="Data-Graph-Inductive-Query-GVD.html#t:Voronoi">Voronoi</a> b <a href="src/Data-Graph-Inductive-Query-GVD.html#gvdIn" class="link">Source</a> <a href="#v:gvdIn" class="selflink">#</a></p><div class="doc"><p>Produce a shortest path forest (the roots of which are those
nodes specified) from nodes in the graph <em>to</em> one of the root
nodes (if possible).</p></div></div><div class="top"><p class="src"><a id="v:gvdOut" class="def">gvdOut</a> :: (<a href="Data-Graph-Inductive-Graph.html#t:Graph">Graph</a> gr, <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.1.0/Prelude.html#t:Real">Real</a> b) => [<a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a>] -> gr a b -> <a href="Data-Graph-Inductive-Query-GVD.html#t:Voronoi">Voronoi</a> b <a href="src/Data-Graph-Inductive-Query-GVD.html#gvdOut" class="link">Source</a> <a href="#v:gvdOut" class="selflink">#</a></p><div class="doc"><p>Produce a shortest path forest (the roots of which are those
nodes specified) from nodes in the graph <em>from</em> one of the root
nodes (if possible).</p></div></div><div class="top"><p class="src"><a id="v:voronoiSet" class="def">voronoiSet</a> :: <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a> -> <a href="Data-Graph-Inductive-Query-GVD.html#t:Voronoi">Voronoi</a> b -> [<a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a>] <a href="src/Data-Graph-Inductive-Query-GVD.html#voronoiSet" class="link">Source</a> <a href="#v:voronoiSet" class="selflink">#</a></p><div class="doc"><p>Return the nodes reachable to/from (depending on how the
<code><a href="Data-Graph-Inductive-Query-GVD.html#t:Voronoi">Voronoi</a></code> was constructed) from the specified root node (if the
specified node is not one of the root nodes of the shortest path
forest, an empty list will be returned).</p></div></div><div class="top"><p class="src"><a id="v:nearestNode" class="def">nearestNode</a> :: <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a> -> <a href="Data-Graph-Inductive-Query-GVD.html#t:Voronoi">Voronoi</a> b -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.1.0/Data-Maybe.html#t:Maybe">Maybe</a> <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a> <a href="src/Data-Graph-Inductive-Query-GVD.html#nearestNode" class="link">Source</a> <a href="#v:nearestNode" class="selflink">#</a></p><div class="doc"><p>Try to determine the nearest root node to the one specified in the
shortest path forest.</p></div></div><div class="top"><p class="src"><a id="v:nearestDist" class="def">nearestDist</a> :: <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a> -> <a href="Data-Graph-Inductive-Query-GVD.html#t:Voronoi">Voronoi</a> b -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.1.0/Data-Maybe.html#t:Maybe">Maybe</a> b <a href="src/Data-Graph-Inductive-Query-GVD.html#nearestDist" class="link">Source</a> <a href="#v:nearestDist" class="selflink">#</a></p><div class="doc"><p>The distance to the <code><a href="Data-Graph-Inductive-Query-GVD.html#v:nearestNode">nearestNode</a></code> (if there is one) in the
shortest path forest.</p></div></div><div class="top"><p class="src"><a id="v:nearestPath" class="def">nearestPath</a> :: <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a> -> <a href="Data-Graph-Inductive-Query-GVD.html#t:Voronoi">Voronoi</a> b -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.1.0/Data-Maybe.html#t:Maybe">Maybe</a> <a href="Data-Graph-Inductive-Graph.html#t:Path">Path</a> <a href="src/Data-Graph-Inductive-Query-GVD.html#nearestPath" class="link">Source</a> <a href="#v:nearestPath" class="selflink">#</a></p><div class="doc"><p>Try to construct a path to/from a specified node to one of the
root nodes of the shortest path forest.</p></div></div></div></div><div id="footer"><p>Produced by <a href="http://www.haskell.org/haddock/">Haddock</a> version 2.17.3</p></div></body></html>
|