Home Explore Help
Sign In
mooigraph
/
regraphlet
Watch 1
Star 0
Fork 0
Files Issues 0 Pull Requests 0 Wiki
Branch: master
Branches Tags
regraphlet
/
orig
/
GTL-1.2.4
/
doc
/
manual
/
a00004.html

a00004.html 52 KB
Permalink History Raw

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901 
  1. <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
    2. 

  2. <html>
    3. 

  3.   <head>
    4. 

  4.     <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
    5. 

  5.       <title>GTL - Graph Template Library: biconnectivity Class Reference</title>
    6. 

  6.       <link href="doxygen.css" rel="stylesheet" type="text/css">
    7. 

  7.   </head>
    8. 

  8.   <body>
    9. 

  9.     <p class="links">  
    10. 

  10.       <a href="../index.html">Home</a> |
    11. 

  11.       Documentation |
    12. 

  12.       <a href="../register.html">Download</a> |
    13. 

  13.       <a href="../platforms.html">Platforms</a> |
    14. 

  14.       <a href="../refer.html">Projects</a> |      
    15. 

  15.       <a href="../lists.html">Mailing Lists</a> |
    16. 

  16.       <a href="../history.html">Version History</a>
    17. 

  17.     </p>
    18. 

  18. 

  19. <!-- Generated by Doxygen 1.5.3 -->
    20. 

  20. <div class="tabs">
    21. 

  21.   <ul>
    22. 

  22.     <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
    23. 

  23.     <li class="current"><a href="classes.html"><span>Classes</span></a></li>
    24. 

  24.     <li><a href="files.html"><span>Files</span></a></li>
    25. 

  25.     <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
    26. 

  26.   </ul>
    27. 

  27. </div>
    28. 

  28. <div class="tabs">
    29. 

  29.   <ul>
    30. 

  30.     <li><a href="classes.html"><span>Alphabetical&nbsp;List</span></a></li>
    31. 

  31.     <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
    32. 

  32.     <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
    33. 

  33.     <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
    34. 

  34.   </ul>
    35. 

  35. </div>
    36. 

  36. <h1>biconnectivity Class Reference</h1><!-- doxytag: class="biconnectivity" --><!-- doxytag: inherits="dfs" -->Biconnectivity-test and low-numbers.  
    37. 

  37. <a href="#_details">More...</a>
    38. 

  38. <p>
    39. 

  39. <div class="dynheader">
    40. 

  40. Inheritance diagram for biconnectivity:</div>
    41. 

  41. <div class="dynsection">
    42. 

  42. <p><center><img src="a00115.gif" border="0" usemap="#a00116" alt="Inheritance graph"></center>
    43. 

  43. <map name="a00116">
    44. 

  44. <area shape="rect" href="a00008.html" title="Depth&#45;First&#45;Search (DFS) algorithm." alt="" coords="37,81,77,105"><area shape="rect" href="a00001.html" title="Abstract baseclass for all algoritm&#45;classes." alt="" coords="19,7,96,31"></map>
    45. 

  45. <center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
    46. 

  46. <div class="dynheader">
    47. 

  47. Collaboration diagram for biconnectivity:</div>
    48. 

  48. <div class="dynsection">
    49. 

  49. <p><center><img src="a00117.gif" border="0" usemap="#a00118" alt="Collaboration graph"></center>
    50. 

  50. <map name="a00118">
    51. 

  51. <area shape="rect" href="a00008.html" title="Depth&#45;First&#45;Search (DFS) algorithm." alt="" coords="655,137,695,161"><area shape="rect" href="a00001.html" title="Abstract baseclass for all algoritm&#45;classes." alt="" coords="401,73,479,97"><area shape="rect" href="a00020.html" title="A node in a graph." alt="" coords="415,208,465,232"><area shape="rect" title="last" alt="" coords="463,215,471,223"><area shape="rect" title="last" alt="" coords="751,195,759,203"><area shape="rect" title="start" alt="" coords="463,209,471,217"><area shape="rect" title="start" alt="" coords="651,153,659,161"><area shape="rect" title="int_node" alt="" coords="411,205,419,213"><area shape="rect" title="int_node" alt="" coords="463,205,471,213"><area shape="rect" href="a00021.html" title="node_map\&lt; int \&gt;" alt="" coords="379,8,501,32"><area shape="rect" title="low_num\ncut_count" alt="" coords="497,5,505,13"><area shape="rect" title="low_num\ncut_count" alt="" coords="795,179,803,187"><area shape="rect" title="comp_number\ndfs_number" alt="" coords="475,29,483,37"><area shape="rect" title="comp_number\ndfs_number" alt="" coords="661,133,669,141"><area shape="rect" href="a00019.html" title="ne_map\&lt; node, int, graph, allocator\&lt; int \&gt; \&gt;" alt="" coords="21,8,304,32"><area shape="rect" href="a00011.html" title="edge_map\&lt; int \&gt;" alt="" coords="379,121,501,145"><area shape="rect" title="used" alt="" coords="497,133,505,141"><area shape="rect" title="used" alt="" coords="651,144,659,152"><area shape="rect" href="a00019.html" title="ne_map\&lt; edge, int, graph, allocator\&lt; int \&gt; \&gt;" alt="" coords="21,121,304,145"><area shape="rect" href="a00021.html" title="node_map\&lt; node \&gt;" alt="" coords="371,271,509,295"><area shape="rect" title="first_child" alt="" coords="505,277,513,285"><area shape="rect" title="first_child" alt="" coords="776,204,784,212"><area shape="rect" title="preds" alt="" coords="495,267,503,275"><area shape="rect" title="preds" alt="" coords="664,159,672,167"><area shape="rect" href="a00019.html" title="ne_map\&lt; node, node, graph, allocator\&lt; node \&gt; \&gt;" alt="" coords="5,271,320,295"></map>
    52. 

  52. <center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
    53. 

  53. 

  54. <p>
    55. 

  55. <a href="a00119.html">List of all members.</a><table border="0" cellpadding="0" cellspacing="0">
    56. 

  56. <tr><td></td></tr>
    57. 

  57. <tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr>
    58. 

  58. <tr><td class="memItemLeft" nowrap align="right" valign="top">&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#9f0c49a04d285f3e45520af863d6cf50">biconnectivity</a> ()</td></tr>
    59. 

  59. 

  60. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Creates <a class="el" href="a00004.html" title="Biconnectivity-test and low-numbers.">biconnectivity</a> <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> object.  <a href="#9f0c49a04d285f3e45520af863d6cf50"></a><br></td></tr>
    61. 

  61. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#f8e2bb061de4a08f95a2a3a94fdbd797">~biconnectivity</a> ()</td></tr>
    62. 

  62. 

  63. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Destroys <a class="el" href="a00004.html" title="Biconnectivity-test and low-numbers.">biconnectivity</a> <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> object.  <a href="#f8e2bb061de4a08f95a2a3a94fdbd797"></a><br></td></tr>
    64. 

  64. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#5db0b38d8d01af52720d6941103de4f2">check</a> (<a class="el" href="a00014.html">graph</a> &amp;G)</td></tr>
    65. 

  65. 

  66. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Checks whether the <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> can be applied.  <a href="#5db0b38d8d01af52720d6941103de4f2"></a><br></td></tr>
    67. 

  67. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#a1a4b091fd8b2bbea2b36b91bab713af">reset</a> ()</td></tr>
    68. 

  68. 

  69. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Resets algorithm.  <a href="#a1a4b091fd8b2bbea2b36b91bab713af"></a><br></td></tr>
    70. 

  70. <tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#e0d0b47a16da24c0f124cb989ccf5846">low_number</a> (const <a class="el" href="a00020.html">node</a> &amp;n) const </td></tr>
    71. 

  71. 

  72. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">low-number.  <a href="#e0d0b47a16da24c0f124cb989ccf5846"></a><br></td></tr>
    73. 

  73. <tr><td class="memItemLeft" nowrap align="right" valign="top">bool&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#2db9457fbbfb6a832234d8455e807198">is_biconnected</a> () const </td></tr>
    74. 

  74. 

  75. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Biconnectivity-test.  <a href="#2db9457fbbfb6a832234d8455e807198"></a><br></td></tr>
    76. 

  76. <tr><td class="memItemLeft" nowrap align="right" valign="top">bool&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#f6fe3286b7cb24e0da460cfdbf733d79">store_components</a> () const </td></tr>
    77. 

  77. 

  78. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Returns whether the storing of <a class="el" href="a00007.html" title="Connected components algorithm.">components</a> is enabled.  <a href="#f6fe3286b7cb24e0da460cfdbf733d79"></a><br></td></tr>
    79. 

  79. <tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#b7c9e256a4d7a4ffea33b20f014e1f69">store_components</a> (bool set)</td></tr>
    80. 

  80. 

  81. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Enables or disables the storing of biconnected <a class="el" href="a00007.html" title="Connected components algorithm.">components</a>.  <a href="#b7c9e256a4d7a4ffea33b20f014e1f69"></a><br></td></tr>
    82. 

  82. <tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#774fd08203a6d164605afc4cdc8b9201">make_biconnected</a> (bool set)</td></tr>
    83. 

  83. 

  84. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">If enabled edges will be added to the <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> in order to make it biconnected, if cutpoints are discovered.  <a href="#774fd08203a6d164605afc4cdc8b9201"></a><br></td></tr>
    85. 

  85. <tr><td class="memItemLeft" nowrap align="right" valign="top">bool&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#2db912e8bc1a89e431116824434e836d">make_biconnected</a> () const </td></tr>
    86. 

  86. 

  87. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Returns whether addition of edges neccessary to make <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> biconnected is enabled.  <a href="#2db912e8bc1a89e431116824434e836d"></a><br></td></tr>
    88. 

  88. <tr><td class="memItemLeft" nowrap align="right" valign="top">list&lt; <a class="el" href="a00010.html">edge</a> &gt;::iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#c5295da180114bffbbfd621d644d4c58">additional_begin</a> ()</td></tr>
    89. 

  89. 

  90. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Begin of edges added to make <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> biconnected.  <a href="#c5295da180114bffbbfd621d644d4c58"></a><br></td></tr>
    91. 

  91. <tr><td class="memItemLeft" nowrap align="right" valign="top">list&lt; <a class="el" href="a00010.html">edge</a> &gt;::iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#447a86f387efd181b25b8bacf3365e75">additional_end</a> ()</td></tr>
    92. 

  92. 

  93. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">End of edges added to make <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> biconnected.  <a href="#447a86f387efd181b25b8bacf3365e75"></a><br></td></tr>
    94. 

  94. <tr><td class="memItemLeft" nowrap align="right" valign="top">cutpoint_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#473197552874aaf148e847838144eed7">cut_points_begin</a> ()</td></tr>
    95. 

  95. 

  96. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Start iteration over all cutpoints found.  <a href="#473197552874aaf148e847838144eed7"></a><br></td></tr>
    97. 

  97. <tr><td class="memItemLeft" nowrap align="right" valign="top">cutpoint_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#78cb06c1d056b9519622a67a92e85b6e">cut_points_end</a> ()</td></tr>
    98. 

  98. 

  99. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">End of iteration over all cutpoints.  <a href="#78cb06c1d056b9519622a67a92e85b6e"></a><br></td></tr>
    100. 

  100. <tr><td class="memItemLeft" nowrap align="right" valign="top">component_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#c0b7253533edc3f1412f771cb35bf04a">components_begin</a> ()</td></tr>
    101. 

  101. 

  102. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Start iteration over all biconnected <a class="el" href="a00007.html" title="Connected components algorithm.">components</a> (if enabled during last call to run).  <a href="#c0b7253533edc3f1412f771cb35bf04a"></a><br></td></tr>
    103. 

  103. <tr><td class="memItemLeft" nowrap align="right" valign="top">component_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#0bd1c70975e664174e591efd64f8dc71">components_end</a> ()</td></tr>
    104. 

  104. 

  105. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">End of iteration over all biconnected <a class="el" href="a00007.html" title="Connected components algorithm.">components</a>.  <a href="#0bd1c70975e664174e591efd64f8dc71"></a><br></td></tr>
    106. 

  106. <tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#c984168e3c2b1b92fc20def2b38fb07f">number_of_components</a> () const </td></tr>
    107. 

  107. 

  108. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Number von biconnected <a class="el" href="a00007.html" title="Connected components algorithm.">components</a> detected during the last run.  <a href="#c984168e3c2b1b92fc20def2b38fb07f"></a><br></td></tr>
    109. 

  109. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#c13bfac43192225a9161b0bf0827f600">init_handler</a> (<a class="el" href="a00014.html">graph</a> &amp;)</td></tr>
    110. 

  110. 

  111. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Handler called before the start of DFS.  <a href="#c13bfac43192225a9161b0bf0827f600"></a><br></td></tr>
    112. 

  112. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#caf5548cba90ee5b6ae3a542ac13e767">entry_handler</a> (<a class="el" href="a00014.html">graph</a> &amp;, <a class="el" href="a00020.html">node</a> &amp;, <a class="el" href="a00020.html">node</a> &amp;)</td></tr>
    113. 

  113. 

  114. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Handler called when touching node <em>n</em>.  <a href="#caf5548cba90ee5b6ae3a542ac13e767"></a><br></td></tr>
    115. 

  115. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#cf4ca6d67f23498c43cfc3669c80417c">before_recursive_call_handler</a> (<a class="el" href="a00014.html">graph</a> &amp;, <a class="el" href="a00010.html">edge</a> &amp;, <a class="el" href="a00020.html">node</a> &amp;)</td></tr>
    116. 

  116. 

  117. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Handler called when a unused node <em>n</em> connected to the actual node by <em>e</em> is found.  <a href="#cf4ca6d67f23498c43cfc3669c80417c"></a><br></td></tr>
    118. 

  118. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#9a2e5d5f934d5ff1d93c545414a7dab5">after_recursive_call_handler</a> (<a class="el" href="a00014.html">graph</a> &amp;, <a class="el" href="a00010.html">edge</a> &amp;, <a class="el" href="a00020.html">node</a> &amp;)</td></tr>
    119. 

  119. 

  120. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Handler called after the algorithm returns from the subtree starting at <em>n</em> connected to the actual node by <em>e</em>.  <a href="#9a2e5d5f934d5ff1d93c545414a7dab5"></a><br></td></tr>
    121. 

  121. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#54c5d1deed1c326f5934f4181770612b">old_adj_node_handler</a> (<a class="el" href="a00014.html">graph</a> &amp;, <a class="el" href="a00010.html">edge</a> &amp;, <a class="el" href="a00020.html">node</a> &amp;)</td></tr>
    122. 

  122. 

  123. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Handler called when a already marked node <em>n</em> connected to the actual node by <em>e</em> is found during the search of all adjacent edges of the actual node.  <a href="#54c5d1deed1c326f5934f4181770612b"></a><br></td></tr>
    124. 

  124. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#e67b0c7d2677f0f60d46995ff244a6d0">new_start_handler</a> (<a class="el" href="a00014.html">graph</a> &amp;, <a class="el" href="a00020.html">node</a> &amp;)</td></tr>
    125. 

  125. 

  126. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Called when DFS is started with start-node <em>n</em>.  <a href="#e67b0c7d2677f0f60d46995ff244a6d0"></a><br></td></tr>
    127. 

  127. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#cbb12e89c368f4346f36d09888d8bfb0">leave_handler</a> (<a class="el" href="a00014.html">graph</a> &amp;, <a class="el" href="a00020.html">node</a> &amp;, <a class="el" href="a00020.html">node</a> &amp;)</td></tr>
    128. 

  128. 

  129. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Handler called after all the adjacent edges of <em>n</em> have been examined.  <a href="#cbb12e89c368f4346f36d09888d8bfb0"></a><br></td></tr>
    130. 

  130. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00004.html#eade3bbc61d1046ba80ec88988f72c44">end_handler</a> (<a class="el" href="a00014.html">graph</a> &amp;)</td></tr>
    131. 

  131. 

  132. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Handler called at the end of DFS.  <a href="#eade3bbc61d1046ba80ec88988f72c44"></a><br></td></tr>
    133. 

  133. </table>
    134. 

  134. <hr><a name="_details"></a><h2>Detailed Description</h2>
    135. 

  135. Biconnectivity-test and low-numbers. 
    136. 

  136. <p>
    137. 

  137. <dl class="rcs" compact><dt><b>Date</b></dt><dd></dd></dl>
    138. 

  138. <dl class="rcs" compact><dt><b>Revision</b></dt><dd></dd></dl>
    139. 

  139. <p>
    140. 

  140. Obviously there is a close relationship between DFS and the testing of <a class="el" href="a00004.html" title="Biconnectivity-test and low-numbers.">biconnectivity</a>. Thus this test takes advantage of the possibility to add pieces of code to the DFS-class in order to calculate the low-numbers.<p>
    141. 

  141. As default no biconnected <a class="el" href="a00007.html" title="Connected components algorithm.">components</a> will be stored and no edges will be added to make the <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> biconnected. The test will run on the whole <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>, even if it is not connected. <hr><h2>Constructor &amp; Destructor Documentation</h2>
    142. 

  142. <a class="anchor" name="9f0c49a04d285f3e45520af863d6cf50"></a><!-- doxytag: member="biconnectivity::biconnectivity" ref="9f0c49a04d285f3e45520af863d6cf50" args="()" -->
    143. 

  143. <div class="memitem">
    144. 

  144. <div class="memproto">
    145. 

  145.       <table class="memname">
    146. 

  146.         <tr>
    147. 

  147.           <td class="memname">biconnectivity::biconnectivity           </td>
    148. 

  148.           <td>(</td>
    149. 

  149.           <td class="paramname">          </td>
    150. 

  150.           <td>&nbsp;)&nbsp;</td>
    151. 

  151.           <td width="100%"></td>
    152. 

  152.         </tr>
    153. 

  153.       </table>
    154. 

  154. </div>
    155. 

  155. <div class="memdoc">
    156. 

  156. 

  157. <p>
    158. 

  158. Creates <a class="el" href="a00004.html" title="Biconnectivity-test and low-numbers.">biconnectivity</a> <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> object. 
    159. 

  159. <p>
    160. 

  160. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00008.html#2399808134dbabf6aa5e1b2e35a73954" title="Constructor.">dfs::dfs</a> </dd></dl>
    161. 

  161. 

  162. </div>
    163. 

  163. </div><p>
    164. 

  164. <a class="anchor" name="f8e2bb061de4a08f95a2a3a94fdbd797"></a><!-- doxytag: member="biconnectivity::~biconnectivity" ref="f8e2bb061de4a08f95a2a3a94fdbd797" args="()" -->
    165. 

  165. <div class="memitem">
    166. 

  166. <div class="memproto">
    167. 

  167.       <table class="memname">
    168. 

  168.         <tr>
    169. 

  169.           <td class="memname">virtual biconnectivity::~biconnectivity           </td>
    170. 

  170.           <td>(</td>
    171. 

  171.           <td class="paramname">          </td>
    172. 

  172.           <td>&nbsp;)&nbsp;</td>
    173. 

  173.           <td width="100%"><code> [inline, virtual]</code></td>
    174. 

  174.         </tr>
    175. 

  175.       </table>
    176. 

  176. </div>
    177. 

  177. <div class="memdoc">
    178. 

  178. 

  179. <p>
    180. 

  180. Destroys <a class="el" href="a00004.html" title="Biconnectivity-test and low-numbers.">biconnectivity</a> <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> object. 
    181. 

  181. <p>
    182. 

  182. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00008.html#998e0c28d20bbbbb5a0d705371e4ed00" title="Destructor.">dfs::~dfs</a> </dd></dl>
    183. 

  183. 

  184. </div>
    185. 

  185. </div><p>
    186. 

  186. <hr><h2>Member Function Documentation</h2>
    187. 

  187. <a class="anchor" name="5db0b38d8d01af52720d6941103de4f2"></a><!-- doxytag: member="biconnectivity::check" ref="5db0b38d8d01af52720d6941103de4f2" args="(graph &amp;G)" -->
    188. 

  188. <div class="memitem">
    189. 

  189. <div class="memproto">
    190. 

  190.       <table class="memname">
    191. 

  191.         <tr>
    192. 

  192.           <td class="memname">virtual int biconnectivity::check           </td>
    193. 

  193.           <td>(</td>
    194. 

  194.           <td class="paramtype"><a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
    195. 

  195.           <td class="paramname"> <em>G</em>          </td>
    196. 

  196.           <td>&nbsp;)&nbsp;</td>
    197. 

  197.           <td width="100%"><code> [virtual]</code></td>
    198. 

  198.         </tr>
    199. 

  199.       </table>
    200. 

  200. </div>
    201. 

  201. <div class="memdoc">
    202. 

  202. 

  203. <p>
    204. 

  204. Checks whether the <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> can be applied. 
    205. 

  205. <p>
    206. 

  206. Necessary preconditions:<ul>
    207. 

  207. <li>G is undirected.</li><li>storing of predecessors is enabled.</li><li>DFS may be applied</li></ul>
    208. 

  208. <p>
    209. 

  209. <dl compact><dt><b>Parameters:</b></dt><dd>
    210. 

  210.   <table border="0" cellspacing="2" cellpadding="0">
    211. 

  211.     <tr><td valign="top"></td><td valign="top"><em>G</em>&nbsp;</td><td><a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>. </td></tr>
    212. 

  212.   </table>
    213. 

  213. </dl>
    214. 

  214. <dl class="return" compact><dt><b>Returns:</b></dt><dd><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67105114c20e4a96a76b5de9f28bf15e282b">algorithm::GTL_OK</a> if binconnectivity-test can be applied to <em>G</em>. </dd></dl>
    215. 

  215. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00008.html#a7c864a6f3a120720138b187b3ed95b5" title="Enables or disables scanning of the whole graph.">dfs::scan_whole_graph</a>, <a class="el" href="a00008.html#7043f46eb3887cbcbb1391fc783407a4" title="Enables or disables the storing of predecessors.">dfs::store_preds</a> </dd></dl>
    216. 

  216. 

  217. <p>Reimplemented from <a class="el" href="a00008.html#908f4ea617ed59767ed334b39a2771d0">dfs</a>.</p>
    218. 

  218. 

  219. </div>
    220. 

  220. </div><p>
    221. 

  221. <a class="anchor" name="a1a4b091fd8b2bbea2b36b91bab713af"></a><!-- doxytag: member="biconnectivity::reset" ref="a1a4b091fd8b2bbea2b36b91bab713af" args="()" -->
    222. 

  222. <div class="memitem">
    223. 

  223. <div class="memproto">
    224. 

  224.       <table class="memname">
    225. 

  225.         <tr>
    226. 

  226.           <td class="memname">virtual void biconnectivity::reset           </td>
    227. 

  227.           <td>(</td>
    228. 

  228.           <td class="paramname">          </td>
    229. 

  229.           <td>&nbsp;)&nbsp;</td>
    230. 

  230.           <td width="100%"><code> [virtual]</code></td>
    231. 

  231.         </tr>
    232. 

  232.       </table>
    233. 

  233. </div>
    234. 

  234. <div class="memdoc">
    235. 

  235. 

  236. <p>
    237. 

  237. Resets algorithm. 
    238. 

  238. <p>
    239. 

  239. Prepares the algorithm to be applied to another graph. <em>Please</em> <em>note:</em> The options an algorithm may support do <em>not</em> get reset by this. It is just to reset internally used datastructures. 
    240. 

  240. <p>Reimplemented from <a class="el" href="a00008.html#1c893f699517cc72624cf171b7bc4da4">dfs</a>.</p>
    241. 

  241. 

  242. </div>
    243. 

  243. </div><p>
    244. 

  244. <a class="anchor" name="e0d0b47a16da24c0f124cb989ccf5846"></a><!-- doxytag: member="biconnectivity::low_number" ref="e0d0b47a16da24c0f124cb989ccf5846" args="(const node &amp;n) const " -->
    245. 

  245. <div class="memitem">
    246. 

  246. <div class="memproto">
    247. 

  247.       <table class="memname">
    248. 

  248.         <tr>
    249. 

  249.           <td class="memname">int biconnectivity::low_number           </td>
    250. 

  250.           <td>(</td>
    251. 

  251.           <td class="paramtype">const <a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
    252. 

  252.           <td class="paramname"> <em>n</em>          </td>
    253. 

  253.           <td>&nbsp;)&nbsp;</td>
    254. 

  254.           <td width="100%"> const<code> [inline]</code></td>
    255. 

  255.         </tr>
    256. 

  256.       </table>
    257. 

  257. </div>
    258. 

  258. <div class="memdoc">
    259. 

  259. 

  260. <p>
    261. 

  261. low-number. 
    262. 

  262. <p>
    263. 

  263. <dl compact><dt><b>Parameters:</b></dt><dd>
    264. 

  264.   <table border="0" cellspacing="2" cellpadding="0">
    265. 

  265.     <tr><td valign="top"></td><td valign="top"><em>n</em>&nbsp;</td><td><a class="el" href="a00020.html" title="A node in a graph.">node</a>. </td></tr>
    266. 

  266.   </table>
    267. 

  267. </dl>
    268. 

  268. <dl class="return" compact><dt><b>Returns:</b></dt><dd>low-number of n. </dd></dl>
    269. 

  269. 

  270. </div>
    271. 

  271. </div><p>
    272. 

  272. <a class="anchor" name="2db9457fbbfb6a832234d8455e807198"></a><!-- doxytag: member="biconnectivity::is_biconnected" ref="2db9457fbbfb6a832234d8455e807198" args="() const " -->
    273. 

  273. <div class="memitem">
    274. 

  274. <div class="memproto">
    275. 

  275.       <table class="memname">
    276. 

  276.         <tr>
    277. 

  277.           <td class="memname">bool biconnectivity::is_biconnected           </td>
    278. 

  278.           <td>(</td>
    279. 

  279.           <td class="paramname">          </td>
    280. 

  280.           <td>&nbsp;)&nbsp;</td>
    281. 

  281.           <td width="100%"> const<code> [inline]</code></td>
    282. 

  282.         </tr>
    283. 

  283.       </table>
    284. 

  284. </div>
    285. 

  285. <div class="memdoc">
    286. 

  286. 

  287. <p>
    288. 

  288. Biconnectivity-test. 
    289. 

  289. <p>
    290. 

  290. <dl class="return" compact><dt><b>Returns:</b></dt><dd>true iff <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> is biconnected. </dd></dl>
    291. 

  291. 

  292. </div>
    293. 

  293. </div><p>
    294. 

  294. <a class="anchor" name="f6fe3286b7cb24e0da460cfdbf733d79"></a><!-- doxytag: member="biconnectivity::store_components" ref="f6fe3286b7cb24e0da460cfdbf733d79" args="() const " -->
    295. 

  295. <div class="memitem">
    296. 

  296. <div class="memproto">
    297. 

  297.       <table class="memname">
    298. 

  298.         <tr>
    299. 

  299.           <td class="memname">bool biconnectivity::store_components           </td>
    300. 

  300.           <td>(</td>
    301. 

  301.           <td class="paramname">          </td>
    302. 

  302.           <td>&nbsp;)&nbsp;</td>
    303. 

  303.           <td width="100%"> const<code> [inline]</code></td>
    304. 

  304.         </tr>
    305. 

  305.       </table>
    306. 

  306. </div>
    307. 

  307. <div class="memdoc">
    308. 

  308. 

  309. <p>
    310. 

  310. Returns whether the storing of <a class="el" href="a00007.html" title="Connected components algorithm.">components</a> is enabled. 
    311. 

  311. <p>
    312. 

  312. <dl class="return" compact><dt><b>Returns:</b></dt><dd>true iff storing of <a class="el" href="a00007.html" title="Connected components algorithm.">components</a> is enabled. </dd></dl>
    313. 

  313. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00004.html#c0b7253533edc3f1412f771cb35bf04a" title="Start iteration over all biconnected components (if enabled during last call to run)...">biconnectivity::components_begin</a>, <a class="el" href="a00004.html#0bd1c70975e664174e591efd64f8dc71" title="End of iteration over all biconnected components.">biconnectivity::components_end</a> </dd></dl>
    314. 

  314. 

  315. </div>
    316. 

  316. </div><p>
    317. 

  317. <a class="anchor" name="b7c9e256a4d7a4ffea33b20f014e1f69"></a><!-- doxytag: member="biconnectivity::store_components" ref="b7c9e256a4d7a4ffea33b20f014e1f69" args="(bool set)" -->
    318. 

  318. <div class="memitem">
    319. 

  319. <div class="memproto">
    320. 

  320.       <table class="memname">
    321. 

  321.         <tr>
    322. 

  322.           <td class="memname">void biconnectivity::store_components           </td>
    323. 

  323.           <td>(</td>
    324. 

  324.           <td class="paramtype">bool&nbsp;</td>
    325. 

  325.           <td class="paramname"> <em>set</em>          </td>
    326. 

  326.           <td>&nbsp;)&nbsp;</td>
    327. 

  327.           <td width="100%"><code> [inline]</code></td>
    328. 

  328.         </tr>
    329. 

  329.       </table>
    330. 

  330. </div>
    331. 

  331. <div class="memdoc">
    332. 

  332. 

  333. <p>
    334. 

  334. Enables or disables the storing of biconnected <a class="el" href="a00007.html" title="Connected components algorithm.">components</a>. 
    335. 

  335. <p>
    336. 

  336. If this feature is enabled, the whole <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> will be scanned in order to get all the biconnected <a class="el" href="a00007.html" title="Connected components algorithm.">components</a> even if the <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> isn't connected. By default this feature is disabled.<p>
    337. 

  337. <dl compact><dt><b>Parameters:</b></dt><dd>
    338. 

  338.   <table border="0" cellspacing="2" cellpadding="0">
    339. 

  339.     <tr><td valign="top"></td><td valign="top"><em>set</em>&nbsp;</td><td>if true each biconnected component will be stored. </td></tr>
    340. 

  340.   </table>
    341. 

  341. </dl>
    342. 

  342. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00004.html#c0b7253533edc3f1412f771cb35bf04a" title="Start iteration over all biconnected components (if enabled during last call to run)...">biconnectivity::components_begin</a>, <a class="el" href="a00004.html#0bd1c70975e664174e591efd64f8dc71" title="End of iteration over all biconnected components.">biconnectivity::components_end</a> </dd></dl>
    343. 

  343. 

  344. </div>
    345. 

  345. </div><p>
    346. 

  346. <a class="anchor" name="774fd08203a6d164605afc4cdc8b9201"></a><!-- doxytag: member="biconnectivity::make_biconnected" ref="774fd08203a6d164605afc4cdc8b9201" args="(bool set)" -->
    347. 

  347. <div class="memitem">
    348. 

  348. <div class="memproto">
    349. 

  349.       <table class="memname">
    350. 

  350.         <tr>
    351. 

  351.           <td class="memname">void biconnectivity::make_biconnected           </td>
    352. 

  352.           <td>(</td>
    353. 

  353.           <td class="paramtype">bool&nbsp;</td>
    354. 

  354.           <td class="paramname"> <em>set</em>          </td>
    355. 

  355.           <td>&nbsp;)&nbsp;</td>
    356. 

  356.           <td width="100%"><code> [inline]</code></td>
    357. 

  357.         </tr>
    358. 

  358.       </table>
    359. 

  359. </div>
    360. 

  360. <div class="memdoc">
    361. 

  361. 

  362. <p>
    363. 

  363. If enabled edges will be added to the <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> in order to make it biconnected, if cutpoints are discovered. 
    364. 

  364. <p>
    365. 

  365. The list of added edges can be accessed via additional_begin and additional_end.<p>
    366. 

  366. <dl compact><dt><b>Parameters:</b></dt><dd>
    367. 

  367.   <table border="0" cellspacing="2" cellpadding="0">
    368. 

  368.     <tr><td valign="top"></td><td valign="top"><em>set</em>&nbsp;</td><td>if true additional edges will we inserted to make the <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> biconnected. </td></tr>
    369. 

  369.   </table>
    370. 

  370. </dl>
    371. 

  371. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00004.html#c5295da180114bffbbfd621d644d4c58" title="Begin of edges added to make graph biconnected.">biconnectivity::additional_begin</a>, <a class="el" href="a00004.html#447a86f387efd181b25b8bacf3365e75" title="End of edges added to make graph biconnected.">biconnectivity::additional_end</a> </dd></dl>
    372. 

  372. 

  373. </div>
    374. 

  374. </div><p>
    375. 

  375. <a class="anchor" name="2db912e8bc1a89e431116824434e836d"></a><!-- doxytag: member="biconnectivity::make_biconnected" ref="2db912e8bc1a89e431116824434e836d" args="() const " -->
    376. 

  376. <div class="memitem">
    377. 

  377. <div class="memproto">
    378. 

  378.       <table class="memname">
    379. 

  379.         <tr>
    380. 

  380.           <td class="memname">bool biconnectivity::make_biconnected           </td>
    381. 

  381.           <td>(</td>
    382. 

  382.           <td class="paramname">          </td>
    383. 

  383.           <td>&nbsp;)&nbsp;</td>
    384. 

  384.           <td width="100%"> const<code> [inline]</code></td>
    385. 

  385.         </tr>
    386. 

  386.       </table>
    387. 

  387. </div>
    388. 

  388. <div class="memdoc">
    389. 

  389. 

  390. <p>
    391. 

  391. Returns whether addition of edges neccessary to make <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> biconnected is enabled. 
    392. 

  392. <p>
    393. 

  393. <dl class="return" compact><dt><b>Returns:</b></dt><dd>true iff addition edges is enabled. </dd></dl>
    394. 

  394. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00004.html#c5295da180114bffbbfd621d644d4c58" title="Begin of edges added to make graph biconnected.">biconnectivity::additional_begin</a>, <a class="el" href="a00004.html#447a86f387efd181b25b8bacf3365e75" title="End of edges added to make graph biconnected.">biconnectivity::additional_end</a> </dd></dl>
    395. 

  395. 

  396. </div>
    397. 

  397. </div><p>
    398. 

  398. <a class="anchor" name="c5295da180114bffbbfd621d644d4c58"></a><!-- doxytag: member="biconnectivity::additional_begin" ref="c5295da180114bffbbfd621d644d4c58" args="()" -->
    399. 

  399. <div class="memitem">
    400. 

  400. <div class="memproto">
    401. 

  401.       <table class="memname">
    402. 

  402.         <tr>
    403. 

  403.           <td class="memname">list&lt;<a class="el" href="a00010.html">edge</a>&gt;::iterator biconnectivity::additional_begin           </td>
    404. 

  404.           <td>(</td>
    405. 

  405.           <td class="paramname">          </td>
    406. 

  406.           <td>&nbsp;)&nbsp;</td>
    407. 

  407.           <td width="100%"><code> [inline]</code></td>
    408. 

  408.         </tr>
    409. 

  409.       </table>
    410. 

  410. </div>
    411. 

  411. <div class="memdoc">
    412. 

  412. 

  413. <p>
    414. 

  414. Begin of edges added to make <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> biconnected. 
    415. 

  415. <p>
    416. 

  416. <dl class="return" compact><dt><b>Returns:</b></dt><dd>begin of additional edges </dd></dl>
    417. 

  417. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00004.html#774fd08203a6d164605afc4cdc8b9201" title="If enabled edges will be added to the graph in order to make it biconnected, if cutpoints...">biconnectivity::make_biconnected</a> </dd></dl>
    418. 

  418. 

  419. </div>
    420. 

  420. </div><p>
    421. 

  421. <a class="anchor" name="447a86f387efd181b25b8bacf3365e75"></a><!-- doxytag: member="biconnectivity::additional_end" ref="447a86f387efd181b25b8bacf3365e75" args="()" -->
    422. 

  422. <div class="memitem">
    423. 

  423. <div class="memproto">
    424. 

  424.       <table class="memname">
    425. 

  425.         <tr>
    426. 

  426.           <td class="memname">list&lt;<a class="el" href="a00010.html">edge</a>&gt;::iterator biconnectivity::additional_end           </td>
    427. 

  427.           <td>(</td>
    428. 

  428.           <td class="paramname">          </td>
    429. 

  429.           <td>&nbsp;)&nbsp;</td>
    430. 

  430.           <td width="100%"><code> [inline]</code></td>
    431. 

  431.         </tr>
    432. 

  432.       </table>
    433. 

  433. </div>
    434. 

  434. <div class="memdoc">
    435. 

  435. 

  436. <p>
    437. 

  437. End of edges added to make <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> biconnected. 
    438. 

  438. <p>
    439. 

  439. <dl class="return" compact><dt><b>Returns:</b></dt><dd>end of additional edges </dd></dl>
    440. 

  440. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00004.html#774fd08203a6d164605afc4cdc8b9201" title="If enabled edges will be added to the graph in order to make it biconnected, if cutpoints...">biconnectivity::make_biconnected</a> </dd></dl>
    441. 

  441. 

  442. </div>
    443. 

  443. </div><p>
    444. 

  444. <a class="anchor" name="473197552874aaf148e847838144eed7"></a><!-- doxytag: member="biconnectivity::cut_points_begin" ref="473197552874aaf148e847838144eed7" args="()" -->
    445. 

  445. <div class="memitem">
    446. 

  446. <div class="memproto">
    447. 

  447.       <table class="memname">
    448. 

  448.         <tr>
    449. 

  449.           <td class="memname">cutpoint_iterator biconnectivity::cut_points_begin           </td>
    450. 

  450.           <td>(</td>
    451. 

  451.           <td class="paramname">          </td>
    452. 

  452.           <td>&nbsp;)&nbsp;</td>
    453. 

  453.           <td width="100%"><code> [inline]</code></td>
    454. 

  454.         </tr>
    455. 

  455.       </table>
    456. 

  456. </div>
    457. 

  457. <div class="memdoc">
    458. 

  458. 

  459. <p>
    460. 

  460. Start iteration over all cutpoints found. 
    461. 

  461. <p>
    462. 

  462. A cutpoints is a <a class="el" href="a00020.html" title="A node in a graph.">node</a> whose removal will disconnect the <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>, thus a <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> with no cutpoints is biconnected and vice versa.<p>
    463. 

  463. <dl class="return" compact><dt><b>Returns:</b></dt><dd>iterator to first cutpoint. </dd></dl>
    464. 

  464. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00004.html#78cb06c1d056b9519622a67a92e85b6e" title="End of iteration over all cutpoints.">biconnectivity::cut_points_end</a> </dd></dl>
    465. 

  465. 

  466. </div>
    467. 

  467. </div><p>
    468. 

  468. <a class="anchor" name="78cb06c1d056b9519622a67a92e85b6e"></a><!-- doxytag: member="biconnectivity::cut_points_end" ref="78cb06c1d056b9519622a67a92e85b6e" args="()" -->
    469. 

  469. <div class="memitem">
    470. 

  470. <div class="memproto">
    471. 

  471.       <table class="memname">
    472. 

  472.         <tr>
    473. 

  473.           <td class="memname">cutpoint_iterator biconnectivity::cut_points_end           </td>
    474. 

  474.           <td>(</td>
    475. 

  475.           <td class="paramname">          </td>
    476. 

  476.           <td>&nbsp;)&nbsp;</td>
    477. 

  477.           <td width="100%"><code> [inline]</code></td>
    478. 

  478.         </tr>
    479. 

  479.       </table>
    480. 

  480. </div>
    481. 

  481. <div class="memdoc">
    482. 

  482. 

  483. <p>
    484. 

  484. End of iteration over all cutpoints. 
    485. 

  485. <p>
    486. 

  486. <dl class="return" compact><dt><b>Returns:</b></dt><dd>one-past-the-end iterator. </dd></dl>
    487. 

  487. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00004.html#473197552874aaf148e847838144eed7" title="Start iteration over all cutpoints found.">biconnectivity::cut_points_begin</a> </dd></dl>
    488. 

  488. 

  489. </div>
    490. 

  490. </div><p>
    491. 

  491. <a class="anchor" name="c0b7253533edc3f1412f771cb35bf04a"></a><!-- doxytag: member="biconnectivity::components_begin" ref="c0b7253533edc3f1412f771cb35bf04a" args="()" -->
    492. 

  492. <div class="memitem">
    493. 

  493. <div class="memproto">
    494. 

  494.       <table class="memname">
    495. 

  495.         <tr>
    496. 

  496.           <td class="memname">component_iterator biconnectivity::components_begin           </td>
    497. 

  497.           <td>(</td>
    498. 

  498.           <td class="paramname">          </td>
    499. 

  499.           <td>&nbsp;)&nbsp;</td>
    500. 

  500.           <td width="100%"><code> [inline]</code></td>
    501. 

  501.         </tr>
    502. 

  502.       </table>
    503. 

  503. </div>
    504. 

  504. <div class="memdoc">
    505. 

  505. 

  506. <p>
    507. 

  507. Start iteration over all biconnected <a class="el" href="a00007.html" title="Connected components algorithm.">components</a> (if enabled during last call to run). 
    508. 

  508. <p>
    509. 

  509. Components are represented as a pair consisting of a list of nodes and a list of edges, i.e. if it is of type component_iterator then *it is of type pair&lt;list&lt;<a class="el" href="a00020.html" title="A node in a graph.">node</a>&gt;,list&lt;<a class="el" href="a00010.html" title="An edge in a graph.">edge</a>&gt; &gt;.<p>
    510. 

  510. <dl class="return" compact><dt><b>Returns:</b></dt><dd>iterator to first component </dd></dl>
    511. 

  511. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00004.html#f6fe3286b7cb24e0da460cfdbf733d79" title="Returns whether the storing of components is enabled.">biconnectivity::store_components</a> </dd></dl>
    512. 

  512. 

  513. </div>
    514. 

  514. </div><p>
    515. 

  515. <a class="anchor" name="0bd1c70975e664174e591efd64f8dc71"></a><!-- doxytag: member="biconnectivity::components_end" ref="0bd1c70975e664174e591efd64f8dc71" args="()" -->
    516. 

  516. <div class="memitem">
    517. 

  517. <div class="memproto">
    518. 

  518.       <table class="memname">
    519. 

  519.         <tr>
    520. 

  520.           <td class="memname">component_iterator biconnectivity::components_end           </td>
    521. 

  521.           <td>(</td>
    522. 

  522.           <td class="paramname">          </td>
    523. 

  523.           <td>&nbsp;)&nbsp;</td>
    524. 

  524.           <td width="100%"><code> [inline]</code></td>
    525. 

  525.         </tr>
    526. 

  526.       </table>
    527. 

  527. </div>
    528. 

  528. <div class="memdoc">
    529. 

  529. 

  530. <p>
    531. 

  531. End of iteration over all biconnected <a class="el" href="a00007.html" title="Connected components algorithm.">components</a>. 
    532. 

  532. <p>
    533. 

  533. <dl class="return" compact><dt><b>Returns:</b></dt><dd>end of iteration over biconnected <a class="el" href="a00007.html" title="Connected components algorithm.">components</a> </dd></dl>
    534. 

  534. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00004.html#f6fe3286b7cb24e0da460cfdbf733d79" title="Returns whether the storing of components is enabled.">biconnectivity::store_components</a> </dd></dl>
    535. 

  535. 

  536. </div>
    537. 

  537. </div><p>
    538. 

  538. <a class="anchor" name="c984168e3c2b1b92fc20def2b38fb07f"></a><!-- doxytag: member="biconnectivity::number_of_components" ref="c984168e3c2b1b92fc20def2b38fb07f" args="() const " -->
    539. 

  539. <div class="memitem">
    540. 

  540. <div class="memproto">
    541. 

  541.       <table class="memname">
    542. 

  542.         <tr>
    543. 

  543.           <td class="memname">int biconnectivity::number_of_components           </td>
    544. 

  544.           <td>(</td>
    545. 

  545.           <td class="paramname">          </td>
    546. 

  546.           <td>&nbsp;)&nbsp;</td>
    547. 

  547.           <td width="100%"> const<code> [inline]</code></td>
    548. 

  548.         </tr>
    549. 

  549.       </table>
    550. 

  550. </div>
    551. 

  551. <div class="memdoc">
    552. 

  552. 

  553. <p>
    554. 

  554. Number von biconnected <a class="el" href="a00007.html" title="Connected components algorithm.">components</a> detected during the last run. 
    555. 

  555. <p>
    556. 

  556. <dl class="return" compact><dt><b>Returns:</b></dt><dd>number of biconnected <a class="el" href="a00007.html" title="Connected components algorithm.">components</a>. </dd></dl>
    557. 

  557. 

  558. </div>
    559. 

  559. </div><p>
    560. 

  560. <a class="anchor" name="c13bfac43192225a9161b0bf0827f600"></a><!-- doxytag: member="biconnectivity::init_handler" ref="c13bfac43192225a9161b0bf0827f600" args="(graph &amp;)" -->
    561. 

  561. <div class="memitem">
    562. 

  562. <div class="memproto">
    563. 

  563.       <table class="memname">
    564. 

  564.         <tr>
    565. 

  565.           <td class="memname">virtual void biconnectivity::init_handler           </td>
    566. 

  566.           <td>(</td>
    567. 

  567.           <td class="paramtype"><a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
    568. 

  568.           <td class="paramname"> <em>G</em>          </td>
    569. 

  569.           <td>&nbsp;)&nbsp;</td>
    570. 

  570.           <td width="100%"><code> [virtual]</code></td>
    571. 

  571.         </tr>
    572. 

  572.       </table>
    573. 

  573. </div>
    574. 

  574. <div class="memdoc">
    575. 

  575. 

  576. <p>
    577. 

  577. Handler called before the start of DFS. 
    578. 

  578. <p>
    579. 

  579. <dl compact><dt><b>Parameters:</b></dt><dd>
    580. 

  580.   <table border="0" cellspacing="2" cellpadding="0">
    581. 

  581.     <tr><td valign="top"></td><td valign="top"><em>G</em>&nbsp;</td><td>graph for which DFS was invoked. </td></tr>
    582. 

  582.   </table>
    583. 

  583. </dl>
    584. 

  584. 

  585. <p>Reimplemented from <a class="el" href="a00008.html#cc82574cd42ab8256e685374bee5fabb">dfs</a>.</p>
    586. 

  586. 

  587. </div>
    588. 

  588. </div><p>
    589. 

  589. <a class="anchor" name="caf5548cba90ee5b6ae3a542ac13e767"></a><!-- doxytag: member="biconnectivity::entry_handler" ref="caf5548cba90ee5b6ae3a542ac13e767" args="(graph &amp;, node &amp;, node &amp;)" -->
    590. 

  590. <div class="memitem">
    591. 

  591. <div class="memproto">
    592. 

  592.       <table class="memname">
    593. 

  593.         <tr>
    594. 

  594.           <td class="memname">virtual void biconnectivity::entry_handler           </td>
    595. 

  595.           <td>(</td>
    596. 

  596.           <td class="paramtype"><a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
    597. 

  597.           <td class="paramname"> <em>G</em>, </td>
    598. 

  598.         </tr>
    599. 

  599.         <tr>
    600. 

  600.           <td class="paramkey"></td>
    601. 

  601.           <td></td>
    602. 

  602.           <td class="paramtype"><a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
    603. 

  603.           <td class="paramname"> <em>n</em>, </td>
    604. 

  604.         </tr>
    605. 

  605.         <tr>
    606. 

  606.           <td class="paramkey"></td>
    607. 

  607.           <td></td>
    608. 

  608.           <td class="paramtype"><a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
    609. 

  609.           <td class="paramname"> <em>f</em></td><td>&nbsp;</td>
    610. 

  610.         </tr>
    611. 

  611.         <tr>
    612. 

  612.           <td></td>
    613. 

  613.           <td>)</td>
    614. 

  614.           <td></td><td></td><td width="100%"><code> [virtual]</code></td>
    615. 

  615.         </tr>
    616. 

  616.       </table>
    617. 

  617. </div>
    618. 

  618. <div class="memdoc">
    619. 

  619. 

  620. <p>
    621. 

  621. Handler called when touching node <em>n</em>. 
    622. 

  622. <p>
    623. 

  623. <dl compact><dt><b>Parameters:</b></dt><dd>
    624. 

  624.   <table border="0" cellspacing="2" cellpadding="0">
    625. 

  625.     <tr><td valign="top"></td><td valign="top"><em>G</em>&nbsp;</td><td>graph for which DFS was invoked. </td></tr>
    626. 

  626.     <tr><td valign="top"></td><td valign="top"><em>n</em>&nbsp;</td><td>actual node. </td></tr>
    627. 

  627.     <tr><td valign="top"></td><td valign="top"><em>f</em>&nbsp;</td><td>predecessor. </td></tr>
    628. 

  628.   </table>
    629. 

  629. </dl>
    630. 

  630. 

  631. <p>Reimplemented from <a class="el" href="a00008.html#73dabe5882226b53494a487b7c34f1d1">dfs</a>.</p>
    632. 

  632. 

  633. </div>
    634. 

  634. </div><p>
    635. 

  635. <a class="anchor" name="cf4ca6d67f23498c43cfc3669c80417c"></a><!-- doxytag: member="biconnectivity::before_recursive_call_handler" ref="cf4ca6d67f23498c43cfc3669c80417c" args="(graph &amp;, edge &amp;, node &amp;)" -->
    636. 

  636. <div class="memitem">
    637. 

  637. <div class="memproto">
    638. 

  638.       <table class="memname">
    639. 

  639.         <tr>
    640. 

  640.           <td class="memname">virtual void biconnectivity::before_recursive_call_handler           </td>
    641. 

  641.           <td>(</td>
    642. 

  642.           <td class="paramtype"><a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
    643. 

  643.           <td class="paramname"> <em>G</em>, </td>
    644. 

  644.         </tr>
    645. 

  645.         <tr>
    646. 

  646.           <td class="paramkey"></td>
    647. 

  647.           <td></td>
    648. 

  648.           <td class="paramtype"><a class="el" href="a00010.html">edge</a> &amp;&nbsp;</td>
    649. 

  649.           <td class="paramname"> <em>e</em>, </td>
    650. 

  650.         </tr>
    651. 

  651.         <tr>
    652. 

  652.           <td class="paramkey"></td>
    653. 

  653.           <td></td>
    654. 

  654.           <td class="paramtype"><a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
    655. 

  655.           <td class="paramname"> <em>n</em></td><td>&nbsp;</td>
    656. 

  656.         </tr>
    657. 

  657.         <tr>
    658. 

  658.           <td></td>
    659. 

  659.           <td>)</td>
    660. 

  660.           <td></td><td></td><td width="100%"><code> [virtual]</code></td>
    661. 

  661.         </tr>
    662. 

  662.       </table>
    663. 

  663. </div>
    664. 

  664. <div class="memdoc">
    665. 

  665. 

  666. <p>
    667. 

  667. Handler called when a unused node <em>n</em> connected to the actual node by <em>e</em> is found. 
    668. 

  668. <p>
    669. 

  669. <dl compact><dt><b>Parameters:</b></dt><dd>
    670. 

  670.   <table border="0" cellspacing="2" cellpadding="0">
    671. 

  671.     <tr><td valign="top"></td><td valign="top"><em>G</em>&nbsp;</td><td>graph for which DFS was invoked. </td></tr>
    672. 

  672.     <tr><td valign="top"></td><td valign="top"><em>e</em>&nbsp;</td><td>edge connecting the actual node to the unused one. </td></tr>
    673. 

  673.     <tr><td valign="top"></td><td valign="top"><em>n</em>&nbsp;</td><td>unused node. </td></tr>
    674. 

  674.   </table>
    675. 

  675. </dl>
    676. 

  676. 

  677. <p>Reimplemented from <a class="el" href="a00008.html#e3f095c9fe6106e82c24543da4844ea3">dfs</a>.</p>
    678. 

  678. 

  679. </div>
    680. 

  680. </div><p>
    681. 

  681. <a class="anchor" name="9a2e5d5f934d5ff1d93c545414a7dab5"></a><!-- doxytag: member="biconnectivity::after_recursive_call_handler" ref="9a2e5d5f934d5ff1d93c545414a7dab5" args="(graph &amp;, edge &amp;, node &amp;)" -->
    682. 

  682. <div class="memitem">
    683. 

  683. <div class="memproto">
    684. 

  684.       <table class="memname">
    685. 

  685.         <tr>
    686. 

  686.           <td class="memname">virtual void biconnectivity::after_recursive_call_handler           </td>
    687. 

  687.           <td>(</td>
    688. 

  688.           <td class="paramtype"><a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
    689. 

  689.           <td class="paramname"> <em>G</em>, </td>
    690. 

  690.         </tr>
    691. 

  691.         <tr>
    692. 

  692.           <td class="paramkey"></td>
    693. 

  693.           <td></td>
    694. 

  694.           <td class="paramtype"><a class="el" href="a00010.html">edge</a> &amp;&nbsp;</td>
    695. 

  695.           <td class="paramname"> <em>e</em>, </td>
    696. 

  696.         </tr>
    697. 

  697.         <tr>
    698. 

  698.           <td class="paramkey"></td>
    699. 

  699.           <td></td>
    700. 

  700.           <td class="paramtype"><a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
    701. 

  701.           <td class="paramname"> <em>n</em></td><td>&nbsp;</td>
    702. 

  702.         </tr>
    703. 

  703.         <tr>
    704. 

  704.           <td></td>
    705. 

  705.           <td>)</td>
    706. 

  706.           <td></td><td></td><td width="100%"><code> [virtual]</code></td>
    707. 

  707.         </tr>
    708. 

  708.       </table>
    709. 

  709. </div>
    710. 

  710. <div class="memdoc">
    711. 

  711. 

  712. <p>
    713. 

  713. Handler called after the algorithm returns from the subtree starting at <em>n</em> connected to the actual node by <em>e</em>. 
    714. 

  714. <p>
    715. 

  715. <dl compact><dt><b>Parameters:</b></dt><dd>
    716. 

  716.   <table border="0" cellspacing="2" cellpadding="0">
    717. 

  717.     <tr><td valign="top"></td><td valign="top"><em>G</em>&nbsp;</td><td>graph for which DFS was invoked. </td></tr>
    718. 

  718.     <tr><td valign="top"></td><td valign="top"><em>e</em>&nbsp;</td><td>edge connecting the actual node to the unused one. </td></tr>
    719. 

  719.     <tr><td valign="top"></td><td valign="top"><em>n</em>&nbsp;</td><td>unused node. </td></tr>
    720. 

  720.   </table>
    721. 

  721. </dl>
    722. 

  722. 

  723. <p>Reimplemented from <a class="el" href="a00008.html#25ae75fe08f1d8c0fedcf9dcae09d092">dfs</a>.</p>
    724. 

  724. 

  725. </div>
    726. 

  726. </div><p>
    727. 

  727. <a class="anchor" name="54c5d1deed1c326f5934f4181770612b"></a><!-- doxytag: member="biconnectivity::old_adj_node_handler" ref="54c5d1deed1c326f5934f4181770612b" args="(graph &amp;, edge &amp;, node &amp;)" -->
    728. 

  728. <div class="memitem">
    729. 

  729. <div class="memproto">
    730. 

  730.       <table class="memname">
    731. 

  731.         <tr>
    732. 

  732.           <td class="memname">virtual void biconnectivity::old_adj_node_handler           </td>
    733. 

  733.           <td>(</td>
    734. 

  734.           <td class="paramtype"><a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
    735. 

  735.           <td class="paramname"> <em>G</em>, </td>
    736. 

  736.         </tr>
    737. 

  737.         <tr>
    738. 

  738.           <td class="paramkey"></td>
    739. 

  739.           <td></td>
    740. 

  740.           <td class="paramtype"><a class="el" href="a00010.html">edge</a> &amp;&nbsp;</td>
    741. 

  741.           <td class="paramname"> <em>e</em>, </td>
    742. 

  742.         </tr>
    743. 

  743.         <tr>
    744. 

  744.           <td class="paramkey"></td>
    745. 

  745.           <td></td>
    746. 

  746.           <td class="paramtype"><a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
    747. 

  747.           <td class="paramname"> <em>n</em></td><td>&nbsp;</td>
    748. 

  748.         </tr>
    749. 

  749.         <tr>
    750. 

  750.           <td></td>
    751. 

  751.           <td>)</td>
    752. 

  752.           <td></td><td></td><td width="100%"><code> [virtual]</code></td>
    753. 

  753.         </tr>
    754. 

  754.       </table>
    755. 

  755. </div>
    756. 

  756. <div class="memdoc">
    757. 

  757. 

  758. <p>
    759. 

  759. Handler called when a already marked node <em>n</em> connected to the actual node by <em>e</em> is found during the search of all adjacent edges of the actual node. 
    760. 

  760. <p>
    761. 

  761. <dl compact><dt><b>Parameters:</b></dt><dd>
    762. 

  762.   <table border="0" cellspacing="2" cellpadding="0">
    763. 

  763.     <tr><td valign="top"></td><td valign="top"><em>G</em>&nbsp;</td><td>graph for which DFS was invoked. </td></tr>
    764. 

  764.     <tr><td valign="top"></td><td valign="top"><em>e</em>&nbsp;</td><td>edge connecting the actual node to the old one. </td></tr>
    765. 

  765.     <tr><td valign="top"></td><td valign="top"><em>n</em>&nbsp;</td><td>used node. </td></tr>
    766. 

  766.   </table>
    767. 

  767. </dl>
    768. 

  768. 

  769. <p>Reimplemented from <a class="el" href="a00008.html#df1c667188e632761c63f529537c544c">dfs</a>.</p>
    770. 

  770. 

  771. </div>
    772. 

  772. </div><p>
    773. 

  773. <a class="anchor" name="e67b0c7d2677f0f60d46995ff244a6d0"></a><!-- doxytag: member="biconnectivity::new_start_handler" ref="e67b0c7d2677f0f60d46995ff244a6d0" args="(graph &amp;, node &amp;)" -->
    774. 

  774. <div class="memitem">
    775. 

  775. <div class="memproto">
    776. 

  776.       <table class="memname">
    777. 

  777.         <tr>
    778. 

  778.           <td class="memname">virtual void biconnectivity::new_start_handler           </td>
    779. 

  779.           <td>(</td>
    780. 

  780.           <td class="paramtype"><a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
    781. 

  781.           <td class="paramname"> <em>G</em>, </td>
    782. 

  782.         </tr>
    783. 

  783.         <tr>
    784. 

  784.           <td class="paramkey"></td>
    785. 

  785.           <td></td>
    786. 

  786.           <td class="paramtype"><a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
    787. 

  787.           <td class="paramname"> <em>n</em></td><td>&nbsp;</td>
    788. 

  788.         </tr>
    789. 

  789.         <tr>
    790. 

  790.           <td></td>
    791. 

  791.           <td>)</td>
    792. 

  792.           <td></td><td></td><td width="100%"><code> [virtual]</code></td>
    793. 

  793.         </tr>
    794. 

  794.       </table>
    795. 

  795. </div>
    796. 

  796. <div class="memdoc">
    797. 

  797. 

  798. <p>
    799. 

  799. Called when DFS is started with start-node <em>n</em>. 
    800. 

  800. <p>
    801. 

  801. This is particularly useful when DFS was invoked with the <a class="el" href="a00008.html#a7c864a6f3a120720138b187b3ed95b5" title="Enables or disables scanning of the whole graph.">scan_whole_graph</a> option.<p>
    802. 

  802. <dl compact><dt><b>Parameters:</b></dt><dd>
    803. 

  803.   <table border="0" cellspacing="2" cellpadding="0">
    804. 

  804.     <tr><td valign="top"></td><td valign="top"><em>G</em>&nbsp;</td><td>graph for which DFS was invoked. </td></tr>
    805. 

  805.     <tr><td valign="top"></td><td valign="top"><em>n</em>&nbsp;</td><td>start-node. </td></tr>
    806. 

  806.   </table>
    807. 

  807. </dl>
    808. 

  808. 

  809. <p>Reimplemented from <a class="el" href="a00008.html#3b5fbea7a7baed9946cfb4444a7f20ea">dfs</a>.</p>
    810. 

  810. 

  811. </div>
    812. 

  812. </div><p>
    813. 

  813. <a class="anchor" name="cbb12e89c368f4346f36d09888d8bfb0"></a><!-- doxytag: member="biconnectivity::leave_handler" ref="cbb12e89c368f4346f36d09888d8bfb0" args="(graph &amp;, node &amp;, node &amp;)" -->
    814. 

  814. <div class="memitem">
    815. 

  815. <div class="memproto">
    816. 

  816.       <table class="memname">
    817. 

  817.         <tr>
    818. 

  818.           <td class="memname">virtual void biconnectivity::leave_handler           </td>
    819. 

  819.           <td>(</td>
    820. 

  820.           <td class="paramtype"><a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
    821. 

  821.           <td class="paramname"> <em>G</em>, </td>
    822. 

  822.         </tr>
    823. 

  823.         <tr>
    824. 

  824.           <td class="paramkey"></td>
    825. 

  825.           <td></td>
    826. 

  826.           <td class="paramtype"><a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
    827. 

  827.           <td class="paramname"> <em>n</em>, </td>
    828. 

  828.         </tr>
    829. 

  829.         <tr>
    830. 

  830.           <td class="paramkey"></td>
    831. 

  831.           <td></td>
    832. 

  832.           <td class="paramtype"><a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
    833. 

  833.           <td class="paramname"> <em>f</em></td><td>&nbsp;</td>
    834. 

  834.         </tr>
    835. 

  835.         <tr>
    836. 

  836.           <td></td>
    837. 

  837.           <td>)</td>
    838. 

  838.           <td></td><td></td><td width="100%"><code> [virtual]</code></td>
    839. 

  839.         </tr>
    840. 

  840.       </table>
    841. 

  841. </div>
    842. 

  842. <div class="memdoc">
    843. 

  843. 

  844. <p>
    845. 

  845. Handler called after all the adjacent edges of <em>n</em> have been examined. 
    846. 

  846. <p>
    847. 

  847. <dl compact><dt><b>Parameters:</b></dt><dd>
    848. 

  848.   <table border="0" cellspacing="2" cellpadding="0">
    849. 

  849.     <tr><td valign="top"></td><td valign="top"><em>G</em>&nbsp;</td><td>graph for which DFS was invoked. </td></tr>
    850. 

  850.     <tr><td valign="top"></td><td valign="top"><em>n</em>&nbsp;</td><td>actual node. </td></tr>
    851. 

  851.     <tr><td valign="top"></td><td valign="top"><em>f</em>&nbsp;</td><td>predecessor. </td></tr>
    852. 

  852.   </table>
    853. 

  853. </dl>
    854. 

  854. 

  855. <p>Reimplemented from <a class="el" href="a00008.html#8071fc4e82deff7ceb2790cd4eb42280">dfs</a>.</p>
    856. 

  856. 

  857. </div>
    858. 

  858. </div><p>
    859. 

  859. <a class="anchor" name="eade3bbc61d1046ba80ec88988f72c44"></a><!-- doxytag: member="biconnectivity::end_handler" ref="eade3bbc61d1046ba80ec88988f72c44" args="(graph &amp;)" -->
    860. 

  860. <div class="memitem">
    861. 

  861. <div class="memproto">
    862. 

  862.       <table class="memname">
    863. 

  863.         <tr>
    864. 

  864.           <td class="memname">virtual void biconnectivity::end_handler           </td>
    865. 

  865.           <td>(</td>
    866. 

  866.           <td class="paramtype"><a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
    867. 

  867.           <td class="paramname"> <em>G</em>          </td>
    868. 

  868.           <td>&nbsp;)&nbsp;</td>
    869. 

  869.           <td width="100%"><code> [virtual]</code></td>
    870. 

  870.         </tr>
    871. 

  871.       </table>
    872. 

  872. </div>
    873. 

  873. <div class="memdoc">
    874. 

  874. 

  875. <p>
    876. 

  876. Handler called at the end of DFS. 
    877. 

  877. <p>
    878. 

  878. <dl compact><dt><b>Parameters:</b></dt><dd>
    879. 

  879.   <table border="0" cellspacing="2" cellpadding="0">
    880. 

  880.     <tr><td valign="top"></td><td valign="top"><em>G</em>&nbsp;</td><td>graph for which DFS was invoked. </td></tr>
    881. 

  881.   </table>
    882. 

  882. </dl>
    883. 

  883. 

  884. <p>Reimplemented from <a class="el" href="a00008.html#b96c7c6183856dd9e356fdcf50835b32">dfs</a>.</p>
    885. 

  885. 

  886. </div>
    887. 

  887. </div><p>
    888. 

  888.     <p class="links">
    889. 

  889.       <a href="http://www.uni-passau.de/">University of Passau</a>
    890. 

  890.       &nbsp;-&nbsp;
    891. 

  891.       <a href="http://www.fmi.uni-passau.de/">FMI</a>
    892. 

  892.       &nbsp;-&nbsp;
    893. 

  893.       <a href="http://www.fmi.uni-passau.de/fmi/lehrstuehle/brandenburg/">Theoretical
    894. 

  894. 	Computer Science</a>
    895. 

  895.     </p>
    896. 

  896.   <div class="copyright">
    897. 

  897.       Design &copy; 2002, 2003 <a href="mailto:raitner@fmi.uni-passau.de">Marcus Raitner</a>,  University of Passau 
    898. 

  898.   </div>
    899. 

  899. </body>
    900. 

  900. </html>
    901. 

  901.