/usr/share/doc/libghc-fgl-doc/html/Data-Graph-Inductive-Query-ArtPoint.html is in libghc-fgl-doc 5.5.0.1-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 | <!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.ArtPoint</title><link href="ocean.css" rel="stylesheet" type="text/css" title="Ocean" /><script src="haddock-util.js" type="text/javascript"></script><script type="text/javascript">//<![CDATA[
window.onload = function () {pageLoad();setSynopsis("mini_Data-Graph-Inductive-Query-ArtPoint.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="src/Data-Graph-Inductive-Query-ArtPoint.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.0.1: 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-Inferred</td></tr></table><p class="caption">Data.Graph.Inductive.Query.ArtPoint</p></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:ap">ap</a> :: <a href="Data-Graph-Inductive-Graph.html#t:Graph">Graph</a> gr => gr a b -> [<a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a>]</li></ul></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src"><a name="v:ap" class="def">ap</a> :: <a href="Data-Graph-Inductive-Graph.html#t:Graph">Graph</a> gr => gr a b -> [<a href="Data-Graph-Inductive-Graph.html#t:Node">Node</a>]<a href="src/Data-Graph-Inductive-Query-ArtPoint.html#ap" class="link">Source</a></p><div class="doc"><p>Finds the articulation points for a connected undirected graph,
by using the low numbers criteria:
</p><p>a) The root node is an articulation point iff it has two or more children.
</p><p>b) An non-root node v is an articulation point iff there exists at least
one child w of v such that lowNumber(w) >= dfsNumber(v).
</p></div></div></div></div><div id="footer"><p>Produced by <a href="http://www.haskell.org/haddock/">Haddock</a> version 2.13.2</p></div></body></html>
|