/usr/share/doc/libghc-fgl-doc/html/Data-Graph-Inductive-Query-BCC.html

<!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.BCC</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-BCC.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="src/Data-Graph-Inductive-Query-BCC.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.BCC</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:bcc">bcc</a> :: <a href="Data-Graph-Inductive-Graph.html#t:DynGraph">DynGraph</a> gr =&gt; gr a b -&gt; [gr a b]</li></ul></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src"><a id="v:bcc" class="def">bcc</a> :: <a href="Data-Graph-Inductive-Graph.html#t:DynGraph">DynGraph</a> gr =&gt; gr a b -&gt; [gr a b] <a href="src/Data-Graph-Inductive-Query-BCC.html#bcc" class="link">Source</a> <a href="#v:bcc" class="selflink">#</a></p><div class="doc"><p>Finds the bi-connected components of an undirected connected graph.
It first finds the articulation points of the graph. Then it disconnects the
graph on each articulation point and computes the connected components.</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>
libghc-fgl-doc 5.5.4.0-1 / usr / share / doc / libghc-fgl-doc / html / Data-Graph-Inductive-Query-BCC.html
