Domů Procházet Nápověda
Přihlásit se
mooigraph
/
regraphlet
Sledovat 1
Oblíbit 0
Rozštěpit 0
Soubory Úkoly 0 Pull Requesty 0 Wiki
Strom: 8a3496fffe
Větve Značky
regraphlet
/
orig
/
GTL-1.2.4
/
doc
/
manual
/
a00028.html

a00028.html 20 KB
Historie Surový

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392 
  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: topsort 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>topsort Class Reference</h1><!-- doxytag: class="topsort" --><!-- doxytag: inherits="dfs" -->Topological sorting.  
    37. 

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

  38. <p>
    39. 

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

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

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

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

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

  44. <area shape="rect" href="a00008.html" title="Depth&#45;First&#45;Search (DFS) algorithm." alt="" coords="24,81,64,105"><area shape="rect" href="a00001.html" title="Abstract baseclass for all algoritm&#45;classes." alt="" coords="5,7,83,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 topsort:</div>
    48. 

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

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

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

  51. <area shape="rect" href="a00008.html" title="Depth&#45;First&#45;Search (DFS) algorithm." alt="" coords="665,119,705,143"><area shape="rect" href="a00001.html" title="Abstract baseclass for all algoritm&#45;classes." alt="" coords="401,101,479,125"><area shape="rect" href="a00020.html" title="A node in a graph." alt="" coords="415,188,465,212"><area shape="rect" title="start" alt="" coords="463,188,471,196"><area shape="rect" title="start" alt="" coords="661,132,669,140"><area shape="rect" title="int_node" alt="" coords="411,185,419,193"><area shape="rect" title="int_node" alt="" coords="463,185,471,193"><area shape="rect" href="a00021.html" title="node_map\&lt; int \&gt;" alt="" coords="379,237,501,261"><area shape="rect" title="top_numbers" alt="" coords="497,240,505,248"><area shape="rect" title="top_numbers" alt="" coords="772,213,780,221"><area shape="rect" title="comp_number\ndfs_number" alt="" coords="497,235,505,243"><area shape="rect" title="comp_number\ndfs_number" alt="" coords="673,140,681,148"><area shape="rect" href="a00019.html" title="ne_map\&lt; node, int, graph, allocator\&lt; int \&gt; \&gt;" alt="" coords="21,237,304,261"><area shape="rect" href="a00011.html" title="edge_map\&lt; int \&gt;" alt="" coords="379,5,501,29"><area shape="rect" title="used" alt="" coords="497,20,505,28"><area shape="rect" title="used" alt="" coords="673,115,681,123"><area shape="rect" href="a00019.html" title="ne_map\&lt; edge, int, graph, allocator\&lt; int \&gt; \&gt;" alt="" coords="21,5,304,29"><area shape="rect" href="a00021.html" title="node_map\&lt; node \&gt;" alt="" coords="371,53,509,77"><area shape="rect" title="preds" alt="" coords="505,72,513,80"><area shape="rect" title="preds" alt="" coords="661,116,669,124"><area shape="rect" href="a00019.html" title="ne_map\&lt; node, node, graph, allocator\&lt; node \&gt; \&gt;" alt="" coords="5,53,320,77"></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="a00209.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="a00028.html#76a9055969b9dbf006320040be9fd5e6">topsort</a> ()</td></tr>
    59. 

  59. 

  60. <tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00028.html#71069dab2159b75a324f3b8a44a88ced">top_num</a> (const <a class="el" href="a00020.html">node</a> &amp;n) const </td></tr>
    61. 

  61. 

  62. <tr><td class="memItemLeft" nowrap align="right" valign="top">bool&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00028.html#6df72e7e38299c30695e9391c3b04383">is_acyclic</a> () const </td></tr>
    63. 

  63. 

  64. <tr><td class="memItemLeft" nowrap align="right" valign="top">topsort_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00028.html#f2b446d051fceb0df31df7057e03025b">top_order_begin</a> () const </td></tr>
    65. 

  65. 

  66. <tr><td class="memItemLeft" nowrap align="right" valign="top">topsort_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00028.html#b4d0debf92c9e5eeceec48856af4b329">top_order_end</a> () const </td></tr>
    67. 

  67. 

  68. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00028.html#d83c28909478d35c737a2c70506407dd">check</a> (<a class="el" href="a00014.html">graph</a> &amp;G)</td></tr>
    69. 

  69. 

  70. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00028.html#403076f952ef640cb3f52c9b1a495a1f">reset</a> ()</td></tr>
    71. 

  71. 

  72. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00028.html#1cd92994d564acf79c37e40bdb292827">init_handler</a> (<a class="el" href="a00014.html">graph</a> &amp;G)</td></tr>
    73. 

  73. 

  74. <tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Handler called before the start of DFS.  <a href="#1cd92994d564acf79c37e40bdb292827"></a><br></td></tr>
    75. 

  75. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00028.html#4401a056e4310ca7eca47587f7da5daf">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>
    76. 

  76. 

  77. <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="#4401a056e4310ca7eca47587f7da5daf"></a><br></td></tr>
    78. 

  78. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00028.html#97074494bbdb878a1e3b6da232e965dd">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>
    79. 

  79. 

  80. <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="#97074494bbdb878a1e3b6da232e965dd"></a><br></td></tr>
    81. 

  81. </table>
    82. 

  82. <hr><a name="_details"></a><h2>Detailed Description</h2>
    83. 

  83. Topological sorting. 
    84. 

  84. <p>
    85. 

  85. Assigns to each <a class="el" href="a00020.html" title="A node in a graph.">node</a> <code>n</code> a number <code>top_num</code> such that for every <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> <code>(u,v)</code> <code>top_num[u]</code> &lt; <code>top_num[v]</code>, if possible, i.e. iff the directed <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> is acyclic.<p>
    86. 

  86. Similar to the testing of <a class="el" href="a00004.html" title="Biconnectivity-test and low-numbers.">biconnectivity</a>, which extends DFS to calculate low-numbers, the topsort-algorithm extends DFS to calculate the new numbering (and thus to test whether such a numbering is possible).<p>
    87. 

  87. In order to traverse all the nodes in the order of its top-numbers, a new iterator, <code>topsort_iterator</code> is provided. <hr><h2>Constructor &amp; Destructor Documentation</h2>
    88. 

  88. <a class="anchor" name="76a9055969b9dbf006320040be9fd5e6"></a><!-- doxytag: member="topsort::topsort" ref="76a9055969b9dbf006320040be9fd5e6" args="()" -->
    89. 

  89. <div class="memitem">
    90. 

  90. <div class="memproto">
    91. 

  91.       <table class="memname">
    92. 

  92.         <tr>
    93. 

  93.           <td class="memname">topsort::topsort           </td>
    94. 

  94.           <td>(</td>
    95. 

  95.           <td class="paramname">          </td>
    96. 

  96.           <td>&nbsp;)&nbsp;</td>
    97. 

  97.           <td width="100%"><code> [inline]</code></td>
    98. 

  98.         </tr>
    99. 

  99.       </table>
    100. 

  100. </div>
    101. 

  101. <div class="memdoc">
    102. 

  102. 

  103. <p>
    104. 

  104. default constructor; enables scanning of the whole_graph.<p>
    105. 

  105. <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>
    106. 

  106. 

  107. </div>
    108. 

  108. </div><p>
    109. 

  109. <hr><h2>Member Function Documentation</h2>
    110. 

  110. <a class="anchor" name="71069dab2159b75a324f3b8a44a88ced"></a><!-- doxytag: member="topsort::top_num" ref="71069dab2159b75a324f3b8a44a88ced" args="(const node &amp;n) const " -->
    111. 

  111. <div class="memitem">
    112. 

  112. <div class="memproto">
    113. 

  113.       <table class="memname">
    114. 

  114.         <tr>
    115. 

  115.           <td class="memname">int topsort::top_num           </td>
    116. 

  116.           <td>(</td>
    117. 

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

  118.           <td class="paramname"> <em>n</em>          </td>
    119. 

  119.           <td>&nbsp;)&nbsp;</td>
    120. 

  120.           <td width="100%"> const<code> [inline]</code></td>
    121. 

  121.         </tr>
    122. 

  122.       </table>
    123. 

  123. </div>
    124. 

  124. <div class="memdoc">
    125. 

  125. 

  126. <p>
    127. 

  127. Number in topological order.<p>
    128. 

  128. <dl compact><dt><b>Parameters:</b></dt><dd>
    129. 

  129.   <table border="0" cellspacing="2" cellpadding="0">
    130. 

  130.     <tr><td valign="top"></td><td valign="top"><em>&lt;code&gt;n&lt;/code&gt;</em>&nbsp;</td><td><a class="el" href="a00020.html" title="A node in a graph.">node</a>. </td></tr>
    131. 

  131.   </table>
    132. 

  132. </dl>
    133. 

  133. <dl class="return" compact><dt><b>Returns:</b></dt><dd>number in topological order. </dd></dl>
    134. 

  134. 

  135. </div>
    136. 

  136. </div><p>
    137. 

  137. <a class="anchor" name="6df72e7e38299c30695e9391c3b04383"></a><!-- doxytag: member="topsort::is_acyclic" ref="6df72e7e38299c30695e9391c3b04383" args="() const " -->
    138. 

  138. <div class="memitem">
    139. 

  139. <div class="memproto">
    140. 

  140.       <table class="memname">
    141. 

  141.         <tr>
    142. 

  142.           <td class="memname">bool topsort::is_acyclic           </td>
    143. 

  143.           <td>(</td>
    144. 

  144.           <td class="paramname">          </td>
    145. 

  145.           <td>&nbsp;)&nbsp;</td>
    146. 

  146.           <td width="100%"> const<code> [inline]</code></td>
    147. 

  147.         </tr>
    148. 

  148.       </table>
    149. 

  149. </div>
    150. 

  150. <div class="memdoc">
    151. 

  151. 

  152. <p>
    153. 

  153. Tests if <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> was acyclic.<p>
    154. 

  154. <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> was acyclic. </dd></dl>
    155. 

  155. 

  156. </div>
    157. 

  157. </div><p>
    158. 

  158. <a class="anchor" name="f2b446d051fceb0df31df7057e03025b"></a><!-- doxytag: member="topsort::top_order_begin" ref="f2b446d051fceb0df31df7057e03025b" args="() const " -->
    159. 

  159. <div class="memitem">
    160. 

  160. <div class="memproto">
    161. 

  161.       <table class="memname">
    162. 

  162.         <tr>
    163. 

  163.           <td class="memname">topsort_iterator topsort::top_order_begin           </td>
    164. 

  164.           <td>(</td>
    165. 

  165.           <td class="paramname">          </td>
    166. 

  166.           <td>&nbsp;)&nbsp;</td>
    167. 

  167.           <td width="100%"> const<code> [inline]</code></td>
    168. 

  168.         </tr>
    169. 

  169.       </table>
    170. 

  170. </div>
    171. 

  171. <div class="memdoc">
    172. 

  172. 

  173. <p>
    174. 

  174. Iterate through nodes in topsort-order.<p>
    175. 

  175. <dl class="return" compact><dt><b>Returns:</b></dt><dd>start-iterator. </dd></dl>
    176. 

  176. 

  177. </div>
    178. 

  178. </div><p>
    179. 

  179. <a class="anchor" name="b4d0debf92c9e5eeceec48856af4b329"></a><!-- doxytag: member="topsort::top_order_end" ref="b4d0debf92c9e5eeceec48856af4b329" args="() const " -->
    180. 

  180. <div class="memitem">
    181. 

  181. <div class="memproto">
    182. 

  182.       <table class="memname">
    183. 

  183.         <tr>
    184. 

  184.           <td class="memname">topsort_iterator topsort::top_order_end           </td>
    185. 

  185.           <td>(</td>
    186. 

  186.           <td class="paramname">          </td>
    187. 

  187.           <td>&nbsp;)&nbsp;</td>
    188. 

  188.           <td width="100%"> const<code> [inline]</code></td>
    189. 

  189.         </tr>
    190. 

  190.       </table>
    191. 

  191. </div>
    192. 

  192. <div class="memdoc">
    193. 

  193. 

  194. <p>
    195. 

  195. Iterate through nodes in topsort-order.<p>
    196. 

  196. <dl class="return" compact><dt><b>Returns:</b></dt><dd>end-iterator. </dd></dl>
    197. 

  197. 

  198. </div>
    199. 

  199. </div><p>
    200. 

  200. <a class="anchor" name="d83c28909478d35c737a2c70506407dd"></a><!-- doxytag: member="topsort::check" ref="d83c28909478d35c737a2c70506407dd" args="(graph &amp;G)" -->
    201. 

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

  202. <div class="memproto">
    203. 

  203.       <table class="memname">
    204. 

  204.         <tr>
    205. 

  205.           <td class="memname">virtual int topsort::check           </td>
    206. 

  206.           <td>(</td>
    207. 

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

  208.           <td class="paramname"> <em>G</em>          </td>
    209. 

  209.           <td>&nbsp;)&nbsp;</td>
    210. 

  210.           <td width="100%"><code> [virtual]</code></td>
    211. 

  211.         </tr>
    212. 

  212.       </table>
    213. 

  213. </div>
    214. 

  214. <div class="memdoc">
    215. 

  215. 

  216. <p>
    217. 

  217. Preconditions: <ul>
    218. 

  218. <li>
    219. 

  219. <code>G</code> is directed. </li>
    220. 

  220. <li>
    221. 

  221. DFS may be applied </li>
    222. 

  222. </ul>
    223. 

  223. <p>
    224. 

  224. <dl compact><dt><b>Parameters:</b></dt><dd>
    225. 

  225.   <table border="0" cellspacing="2" cellpadding="0">
    226. 

  226.     <tr><td valign="top"></td><td valign="top"><em>&lt;code&gt;G&lt;/code&gt;</em>&nbsp;</td><td><a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>. </td></tr>
    227. 

  227.   </table>
    228. 

  228. </dl>
    229. 

  229. <dl class="return" compact><dt><b>Returns:</b></dt><dd><code><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67105114c20e4a96a76b5de9f28bf15e282b">algorithm::GTL_OK</a></code> if <a class="el" href="a00028.html" title="Topological sorting.">topsort</a> may be applied to <code>G</code>. </dd></dl>
    230. 

  230. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00008.html#908f4ea617ed59767ed334b39a2771d0" title="Checks whether the preconditions for DFS are satisfied.">dfs::check</a> </dd></dl>
    231. 

  231. 

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

  233. 

  234. </div>
    235. 

  235. </div><p>
    236. 

  236. <a class="anchor" name="403076f952ef640cb3f52c9b1a495a1f"></a><!-- doxytag: member="topsort::reset" ref="403076f952ef640cb3f52c9b1a495a1f" args="()" -->
    237. 

  237. <div class="memitem">
    238. 

  238. <div class="memproto">
    239. 

  239.       <table class="memname">
    240. 

  240.         <tr>
    241. 

  241.           <td class="memname">virtual void topsort::reset           </td>
    242. 

  242.           <td>(</td>
    243. 

  243.           <td class="paramname">          </td>
    244. 

  244.           <td>&nbsp;)&nbsp;</td>
    245. 

  245.           <td width="100%"><code> [virtual]</code></td>
    246. 

  246.         </tr>
    247. 

  247.       </table>
    248. 

  248. </div>
    249. 

  249. <div class="memdoc">
    250. 

  250. 

  251. <p>
    252. 

  252. Reset <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00008.html#1c893f699517cc72624cf171b7bc4da4" title="Resets algorithm.">dfs::reset</a> </dd></dl>
    253. 

  253. 

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

  255. 

  256. </div>
    257. 

  257. </div><p>
    258. 

  258. <a class="anchor" name="1cd92994d564acf79c37e40bdb292827"></a><!-- doxytag: member="topsort::init_handler" ref="1cd92994d564acf79c37e40bdb292827" args="(graph &amp;G)" -->
    259. 

  259. <div class="memitem">
    260. 

  260. <div class="memproto">
    261. 

  261.       <table class="memname">
    262. 

  262.         <tr>
    263. 

  263.           <td class="memname">virtual void topsort::init_handler           </td>
    264. 

  264.           <td>(</td>
    265. 

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

  266.           <td class="paramname"> <em>G</em>          </td>
    267. 

  267.           <td>&nbsp;)&nbsp;</td>
    268. 

  268.           <td width="100%"><code> [virtual]</code></td>
    269. 

  269.         </tr>
    270. 

  270.       </table>
    271. 

  271. </div>
    272. 

  272. <div class="memdoc">
    273. 

  273. 

  274. <p>
    275. 

  275. Handler called before the start of DFS. 
    276. 

  276. <p>
    277. 

  277. <dl compact><dt><b>Parameters:</b></dt><dd>
    278. 

  278.   <table border="0" cellspacing="2" cellpadding="0">
    279. 

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

  280.   </table>
    281. 

  281. </dl>
    282. 

  282. 

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

  284. 

  285. </div>
    286. 

  286. </div><p>
    287. 

  287. <a class="anchor" name="4401a056e4310ca7eca47587f7da5daf"></a><!-- doxytag: member="topsort::leave_handler" ref="4401a056e4310ca7eca47587f7da5daf" args="(graph &amp;, node &amp;, node &amp;)" -->
    288. 

  288. <div class="memitem">
    289. 

  289. <div class="memproto">
    290. 

  290.       <table class="memname">
    291. 

  291.         <tr>
    292. 

  292.           <td class="memname">virtual void topsort::leave_handler           </td>
    293. 

  293.           <td>(</td>
    294. 

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

  295.           <td class="paramname"> <em>G</em>, </td>
    296. 

  296.         </tr>
    297. 

  297.         <tr>
    298. 

  298.           <td class="paramkey"></td>
    299. 

  299.           <td></td>
    300. 

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

  301.           <td class="paramname"> <em>n</em>, </td>
    302. 

  302.         </tr>
    303. 

  303.         <tr>
    304. 

  304.           <td class="paramkey"></td>
    305. 

  305.           <td></td>
    306. 

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

  307.           <td class="paramname"> <em>f</em></td><td>&nbsp;</td>
    308. 

  308.         </tr>
    309. 

  309.         <tr>
    310. 

  310.           <td></td>
    311. 

  311.           <td>)</td>
    312. 

  312.           <td></td><td></td><td width="100%"><code> [virtual]</code></td>
    313. 

  313.         </tr>
    314. 

  314.       </table>
    315. 

  315. </div>
    316. 

  316. <div class="memdoc">
    317. 

  317. 

  318. <p>
    319. 

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

  320. <p>
    321. 

  321. <dl compact><dt><b>Parameters:</b></dt><dd>
    322. 

  322.   <table border="0" cellspacing="2" cellpadding="0">
    323. 

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

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

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

  326.   </table>
    327. 

  327. </dl>
    328. 

  328. 

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

  330. 

  331. </div>
    332. 

  332. </div><p>
    333. 

  333. <a class="anchor" name="97074494bbdb878a1e3b6da232e965dd"></a><!-- doxytag: member="topsort::old_adj_node_handler" ref="97074494bbdb878a1e3b6da232e965dd" args="(graph &amp;, edge &amp;, node &amp;)" -->
    334. 

  334. <div class="memitem">
    335. 

  335. <div class="memproto">
    336. 

  336.       <table class="memname">
    337. 

  337.         <tr>
    338. 

  338.           <td class="memname">virtual void topsort::old_adj_node_handler           </td>
    339. 

  339.           <td>(</td>
    340. 

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

  341.           <td class="paramname"> <em>G</em>, </td>
    342. 

  342.         </tr>
    343. 

  343.         <tr>
    344. 

  344.           <td class="paramkey"></td>
    345. 

  345.           <td></td>
    346. 

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

  347.           <td class="paramname"> <em>e</em>, </td>
    348. 

  348.         </tr>
    349. 

  349.         <tr>
    350. 

  350.           <td class="paramkey"></td>
    351. 

  351.           <td></td>
    352. 

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

  353.           <td class="paramname"> <em>n</em></td><td>&nbsp;</td>
    354. 

  354.         </tr>
    355. 

  355.         <tr>
    356. 

  356.           <td></td>
    357. 

  357.           <td>)</td>
    358. 

  358.           <td></td><td></td><td width="100%"><code> [virtual]</code></td>
    359. 

  359.         </tr>
    360. 

  360.       </table>
    361. 

  361. </div>
    362. 

  362. <div class="memdoc">
    363. 

  363. 

  364. <p>
    365. 

  365. 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. 
    366. 

  366. <p>
    367. 

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

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

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

  370.     <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>
    371. 

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

  372.   </table>
    373. 

  373. </dl>
    374. 

  374. 

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

  376. 

  377. </div>
    378. 

  378. </div><p>
    379. 

  379.     <p class="links">
    380. 

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

  381.       &nbsp;-&nbsp;
    382. 

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

  383.       &nbsp;-&nbsp;
    384. 

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

  385. 	Computer Science</a>
    386. 

  386.     </p>
    387. 

  387.   <div class="copyright">
    388. 

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

  389.   </div>
    390. 

  390. </body>
    391. 

  391. </html>
    392. 

  392.