/usr/share/doc/libghc-fgl-doc/html/Data-Graph-Inductive-Query-SP.html is in libghc-fgl-doc 5.5.3.0-3.
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 | <!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.SP</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-SP.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="src/Data-Graph-Inductive-Query-SP.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.3.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.SP</p></div><div id="description"><p class="caption">Description</p><div class="doc"><p>Shortest path algorithms</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"><a href="#v:spTree">spTree</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.0.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-SP.html#t:LRTree">LRTree</a> b</li><li class="src short"><a href="#v:sp">sp</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.0.0/Prelude.html#t:Real">Real</a> b) => <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a> -> <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a> -> gr a b -> <a href="Data-Graph-Inductive-Graph.html#t:Path">Path</a></li><li class="src short"><a href="#v:spLength">spLength</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.0.0/Prelude.html#t:Real">Real</a> b) => <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a> -> <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a> -> gr a b -> b</li><li class="src short"><a href="#v:dijkstra">dijkstra</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.0.0/Prelude.html#t:Real">Real</a> b) => <a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> b (<a href="Data-Graph-Inductive-Graph.html#t:LPath">LPath</a> b) -> gr a b -> <a href="Data-Graph-Inductive-Query-SP.html#t:LRTree">LRTree</a> b</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"><span class="keyword">data</span> <a href="#t:Heap">Heap</a> a b</li></ul></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src"><a id="v:spTree" class="def">spTree</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.0.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-SP.html#t:LRTree">LRTree</a> b <a href="src/Data-Graph-Inductive-Query-SP.html#spTree" class="link">Source</a> <a href="#v:spTree" class="selflink">#</a></p><div class="doc"><p>Tree of shortest paths from a certain node to the rest of the
(reachable) nodes.</p><p>Corresponds to <code><a href="Data-Graph-Inductive-Query-SP.html#v:dijkstra">dijkstra</a></code> applied to a heap in which the only known node is
the starting node, with a path of length 0 leading to it.</p></div></div><div class="top"><p class="src"><a id="v:sp" class="def">sp</a> <a href="src/Data-Graph-Inductive-Query-SP.html#sp" class="link">Source</a> <a href="#v:sp" class="selflink">#</a></p><div class="subs arguments"><p class="caption">Arguments</p><table><tr><td class="src">:: (<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.0.0/Prelude.html#t:Real">Real</a> b)</td><td class="doc empty"> </td></tr><tr><td class="src">=> <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a></td><td class="doc"><p>Start</p></td></tr><tr><td class="src">-> <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a></td><td class="doc"><p>Destination</p></td></tr><tr><td class="src">-> gr a b</td><td class="doc empty"> </td></tr><tr><td class="src">-> <a href="Data-Graph-Inductive-Graph.html#t:Path">Path</a></td><td class="doc empty"> </td></tr></table></div><div class="doc"><p>Shortest path between two nodes.</p></div></div><div class="top"><p class="src"><a id="v:spLength" class="def">spLength</a> <a href="src/Data-Graph-Inductive-Query-SP.html#spLength" class="link">Source</a> <a href="#v:spLength" class="selflink">#</a></p><div class="subs arguments"><p class="caption">Arguments</p><table><tr><td class="src">:: (<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.0.0/Prelude.html#t:Real">Real</a> b)</td><td class="doc empty"> </td></tr><tr><td class="src">=> <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a></td><td class="doc"><p>Start</p></td></tr><tr><td class="src">-> <a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a></td><td class="doc"><p>Destination</p></td></tr><tr><td class="src">-> gr a b</td><td class="doc empty"> </td></tr><tr><td class="src">-> b</td><td class="doc empty"> </td></tr></table></div><div class="doc"><p>Length of the shortest path between two nodes.</p></div></div><div class="top"><p class="src"><a id="v:dijkstra" class="def">dijkstra</a> <a href="src/Data-Graph-Inductive-Query-SP.html#dijkstra" class="link">Source</a> <a href="#v:dijkstra" class="selflink">#</a></p><div class="subs arguments"><p class="caption">Arguments</p><table><tr><td class="src">:: (<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.0.0/Prelude.html#t:Real">Real</a> b)</td><td class="doc empty"> </td></tr><tr><td class="src">=> <a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> b (<a href="Data-Graph-Inductive-Graph.html#t:LPath">LPath</a> b)</td><td class="doc"><p>Initial heap of known paths and their lengths.</p></td></tr><tr><td class="src">-> gr a b</td><td class="doc empty"> </td></tr><tr><td class="src">-> <a href="Data-Graph-Inductive-Query-SP.html#t:LRTree">LRTree</a> b</td><td class="doc empty"> </td></tr></table></div><div class="doc"><p>Dijkstra's shortest path algorithm.</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"><span class="keyword">data</span> <a id="t:Heap" class="def">Heap</a> a b <a href="src/Data-Graph-Inductive-Internal-Heap.html#Heap" class="link">Source</a> <a href="#t:Heap" class="selflink">#</a></p><div class="subs instances"><p id="control.i:Heap" class="caption collapser" onclick="toggleSection('i:Heap')">Instances</p><div id="section.i:Heap" class="show"><table><tr><td class="src clearfix"><span class="inst-left"><span id="control.i:id:Heap:Eq:1" class="instance expander" onclick="toggleSection('i:id:Heap:Eq:1')"></span> (<a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Data-Eq.html#t:Eq">Eq</a> a, <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Data-Eq.html#t:Eq">Eq</a> b) => <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Data-Eq.html#t:Eq">Eq</a> (<a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b)</span> <a href="src/Data-Graph-Inductive-Internal-Heap.html#line-22" class="link">Source</a> <a href="#t:Heap" class="selflink">#</a></td><td class="doc empty"> </td></tr><tr><td colspan="2"><div id="section.i:id:Heap:Eq:1" class="inst-details hide"><div class="subs methods"><p class="caption">Methods</p><p class="src"><a href="#v:-61--61-">(==)</a> :: <a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b -> <a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Data-Bool.html#t:Bool">Bool</a> <a href="#v:-61--61-" class="selflink">#</a></p><p class="src"><a href="#v:-47--61-">(/=)</a> :: <a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b -> <a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Data-Bool.html#t:Bool">Bool</a> <a href="#v:-47--61-" class="selflink">#</a></p></div></div></td></tr><tr><td class="src clearfix"><span class="inst-left"><span id="control.i:id:Heap:Read:2" class="instance expander" onclick="toggleSection('i:id:Heap:Read:2')"></span> (<a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Text-Read.html#t:Read">Read</a> a, <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Text-Read.html#t:Read">Read</a> b) => <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Text-Read.html#t:Read">Read</a> (<a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b)</span> <a href="src/Data-Graph-Inductive-Internal-Heap.html#line-22" class="link">Source</a> <a href="#t:Heap" class="selflink">#</a></td><td class="doc empty"> </td></tr><tr><td colspan="2"><div id="section.i:id:Heap:Read:2" class="inst-details hide"><div class="subs methods"><p class="caption">Methods</p><p class="src"><a href="#v:readsPrec">readsPrec</a> :: <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Data-Int.html#t:Int">Int</a> -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Text-ParserCombinators-ReadP.html#t:ReadS">ReadS</a> (<a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b) <a href="#v:readsPrec" class="selflink">#</a></p><p class="src"><a href="#v:readList">readList</a> :: <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Text-ParserCombinators-ReadP.html#t:ReadS">ReadS</a> [<a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b] <a href="#v:readList" class="selflink">#</a></p><p class="src"><a href="#v:readPrec">readPrec</a> :: <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Text-ParserCombinators-ReadPrec.html#t:ReadPrec">ReadPrec</a> (<a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b) <a href="#v:readPrec" class="selflink">#</a></p><p class="src"><a href="#v:readListPrec">readListPrec</a> :: <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Text-ParserCombinators-ReadPrec.html#t:ReadPrec">ReadPrec</a> [<a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b] <a href="#v:readListPrec" class="selflink">#</a></p></div></div></td></tr><tr><td class="src clearfix"><span class="inst-left"><span id="control.i:id:Heap:Show:3" class="instance expander" onclick="toggleSection('i:id:Heap:Show:3')"></span> (<a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Text-Show.html#t:Show">Show</a> a, <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Text-Show.html#t:Show">Show</a> b) => <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Text-Show.html#t:Show">Show</a> (<a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b)</span> <a href="src/Data-Graph-Inductive-Internal-Heap.html#line-22" class="link">Source</a> <a href="#t:Heap" class="selflink">#</a></td><td class="doc empty"> </td></tr><tr><td colspan="2"><div id="section.i:id:Heap:Show:3" class="inst-details hide"><div class="subs methods"><p class="caption">Methods</p><p class="src"><a href="#v:showsPrec">showsPrec</a> :: <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Data-Int.html#t:Int">Int</a> -> <a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Text-Show.html#t:ShowS">ShowS</a> <a href="#v:showsPrec" class="selflink">#</a></p><p class="src"><a href="#v:show">show</a> :: <a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Data-String.html#t:String">String</a> <a href="#v:show" class="selflink">#</a></p><p class="src"><a href="#v:showList">showList</a> :: [<a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b] -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.9.0.0/Text-Show.html#t:ShowS">ShowS</a> <a href="#v:showList" class="selflink">#</a></p></div></div></td></tr><tr><td class="src clearfix"><span class="inst-left"><span id="control.i:id:Heap:NFData:4" class="instance expander" onclick="toggleSection('i:id:Heap:NFData:4')"></span> (<a href="file:///usr/share/doc/ghc-doc/html/libraries/deepseq-1.4.2.0/Control-DeepSeq.html#t:NFData">NFData</a> a, <a href="file:///usr/share/doc/ghc-doc/html/libraries/deepseq-1.4.2.0/Control-DeepSeq.html#t:NFData">NFData</a> b) => <a href="file:///usr/share/doc/ghc-doc/html/libraries/deepseq-1.4.2.0/Control-DeepSeq.html#t:NFData">NFData</a> (<a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b)</span> <a href="src/Data-Graph-Inductive-Internal-Heap.html#line-25" class="link">Source</a> <a href="#t:Heap" class="selflink">#</a></td><td class="doc empty"> </td></tr><tr><td colspan="2"><div id="section.i:id:Heap:NFData:4" class="inst-details hide"><div class="subs methods"><p class="caption">Methods</p><p class="src"><a href="#v:rnf">rnf</a> :: <a href="Data-Graph-Inductive-Query-SP.html#t:Heap">Heap</a> a b -> () <a href="#v:rnf" class="selflink">#</a></p></div></div></td></tr></table></div></div></div></div></div><div id="footer"><p>Produced by <a href="http://www.haskell.org/haddock/">Haddock</a> version 2.17.2</p></div></body></html>
|