a00016.html 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379
  1. <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
  2. <html>
  3. <head>
  4. <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
  5. <title>GTL - Graph Template Library: maxflow_pp Class Reference</title>
  6. <link href="doxygen.css" rel="stylesheet" type="text/css">
  7. </head>
  8. <body>
  9. <p class="links">
  10. <a href="../index.html">Home</a> |
  11. Documentation |
  12. <a href="../register.html">Download</a> |
  13. <a href="../platforms.html">Platforms</a> |
  14. <a href="../refer.html">Projects</a> |
  15. <a href="../lists.html">Mailing Lists</a> |
  16. <a href="../history.html">Version History</a>
  17. </p>
  18. <!-- Generated by Doxygen 1.5.3 -->
  19. <div class="tabs">
  20. <ul>
  21. <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
  22. <li class="current"><a href="classes.html"><span>Classes</span></a></li>
  23. <li><a href="files.html"><span>Files</span></a></li>
  24. <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  25. </ul>
  26. </div>
  27. <div class="tabs">
  28. <ul>
  29. <li><a href="classes.html"><span>Alphabetical&nbsp;List</span></a></li>
  30. <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
  31. <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
  32. <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
  33. </ul>
  34. </div>
  35. <h1>maxflow_pp Class Reference</h1><!-- doxytag: class="maxflow_pp" --><!-- doxytag: inherits="algorithm" -->Maximum flow <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> (Malhotra, Kumar, Maheshwari).
  36. <a href="#_details">More...</a>
  37. <p>
  38. <div class="dynheader">
  39. Inheritance diagram for maxflow_pp:</div>
  40. <div class="dynsection">
  41. <p><center><img src="a00159.gif" border="0" usemap="#a00160" alt="Inheritance graph"></center>
  42. <map name="a00160">
  43. <area shape="rect" href="a00001.html" title="Abstract baseclass for all algoritm&#45;classes." alt="" coords="13,7,91,31"></map>
  44. <center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
  45. <div class="dynheader">
  46. Collaboration diagram for maxflow_pp:</div>
  47. <div class="dynsection">
  48. <p><center><img src="a00161.gif" border="0" usemap="#a00162" alt="Collaboration graph"></center>
  49. <map name="a00162">
  50. <area shape="rect" href="a00001.html" title="Abstract baseclass for all algoritm&#45;classes." alt="" coords="428,5,505,29"><area shape="rect" href="a00020.html" title="A node in a graph." alt="" coords="441,92,492,116"><area shape="rect" title="net_source\nnet_target" alt="" coords="489,99,497,107"><area shape="rect" title="net_source\nnet_target" alt="" coords="728,151,736,159"><area shape="rect" title="int_node" alt="" coords="437,91,445,99"><area shape="rect" title="int_node" alt="" coords="489,89,497,97"><area shape="rect" href="a00011.html" title="edge_map\&lt; double \&gt;" alt="" coords="392,153,541,177"><area shape="rect" title="edge_max_flow\nedge_capacity\nflow_update" alt="" coords="537,161,545,169"><area shape="rect" title="edge_max_flow\nedge_capacity\nflow_update" alt="" coords="696,163,704,171"><area shape="rect" href="a00019.html" title="ne_map\&lt; edge, double, graph, allocator\&lt; double \&gt; \&gt;" alt="" coords="7,153,340,177"><area shape="rect" href="a00011.html" title="edge_map\&lt; edge \&gt;" alt="" coords="397,201,536,225"><area shape="rect" title="back_edge" alt="" coords="532,203,540,211"><area shape="rect" title="back_edge" alt="" coords="700,176,708,184"><area shape="rect" href="a00019.html" title="ne_map\&lt; edge, edge, graph, allocator\&lt; edge \&gt; \&gt;" alt="" coords="16,201,331,225"><area shape="rect" href="a00011.html" title="edge_map\&lt; bool \&gt;" alt="" coords="400,260,533,284"><area shape="rect" title="edge_org\nback_edge_exists" alt="" coords="531,269,539,277"><area shape="rect" title="edge_org\nback_edge_exists" alt="" coords="733,176,741,184"><area shape="rect" href="a00019.html" title="ne_map\&lt; edge, bool, graph, allocator\&lt; bool \&gt; \&gt;" alt="" coords="21,260,325,284"></map>
  51. <center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
  52. <p>
  53. <a href="a00163.html">List of all members.</a><table border="0" cellpadding="0" cellspacing="0">
  54. <tr><td></td></tr>
  55. <tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr>
  56. <tr><td class="memItemLeft" nowrap align="right" valign="top">&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00016.html#d2583a416f44b926aa575ab2ba00a35f">maxflow_pp</a> ()</td></tr>
  57. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00016.html#0583bbda2d13f0dd1cb751cd02f755d3">~maxflow_pp</a> ()</td></tr>
  58. <tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00016.html#c77f4c613efe7857e053f9bfb103dc3e">set_vars</a> (const <a class="el" href="a00011.html">edge_map</a>&lt; double &gt; &amp;edge_capacity)</td></tr>
  59. <tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00016.html#13756f76387cc114b88a44e324fc93ae">set_vars</a> (const <a class="el" href="a00011.html">edge_map</a>&lt; double &gt; &amp;edge_capacity, const <a class="el" href="a00020.html">node</a> &amp;net_source, const <a class="el" href="a00020.html">node</a> &amp;net_target)</td></tr>
  60. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00016.html#05bb51b4f7ab213b6624188a0e64a025">check</a> (<a class="el" href="a00014.html">graph</a> &amp;G)</td></tr>
  61. <tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00016.html#07c7cb1ae5db23d87cf49ce7769b2814">run</a> (<a class="el" href="a00014.html">graph</a> &amp;G)</td></tr>
  62. <tr><td class="memItemLeft" nowrap align="right" valign="top">double&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00016.html#aa7c72c190ce34a6645b80999b096a74">get_max_flow</a> (const <a class="el" href="a00010.html">edge</a> &amp;e) const </td></tr>
  63. <tr><td class="memItemLeft" nowrap align="right" valign="top">double&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00016.html#e94e30257b7e9db479d4c2d2d5d1095e">get_max_flow</a> () const </td></tr>
  64. <tr><td class="memItemLeft" nowrap align="right" valign="top">double&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00016.html#bf0163c72a53b8af0c48580e156e880c">get_rem_cap</a> (const <a class="el" href="a00010.html">edge</a> &amp;e) const </td></tr>
  65. <tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00016.html#039b1c893b2197a1f3fe0586c2d3e802">reset</a> ()</td></tr>
  66. </table>
  67. <hr><a name="_details"></a><h2>Detailed Description</h2>
  68. Maximum flow <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> (Malhotra, Kumar, Maheshwari). <hr><h2>Constructor &amp; Destructor Documentation</h2>
  69. <a class="anchor" name="d2583a416f44b926aa575ab2ba00a35f"></a><!-- doxytag: member="maxflow_pp::maxflow_pp" ref="d2583a416f44b926aa575ab2ba00a35f" args="()" -->
  70. <div class="memitem">
  71. <div class="memproto">
  72. <table class="memname">
  73. <tr>
  74. <td class="memname">maxflow_pp::maxflow_pp </td>
  75. <td>(</td>
  76. <td class="paramname"> </td>
  77. <td>&nbsp;)&nbsp;</td>
  78. <td width="100%"></td>
  79. </tr>
  80. </table>
  81. </div>
  82. <div class="memdoc">
  83. <p>
  84. Default constructor. Enables only the calculation of maximum flow.<p>
  85. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00001.html#b79e1ddec2f2afdf4b36b10724db8b15" title="Creates an algorithm object.">algorithm::algorithm</a> </dd></dl>
  86. </div>
  87. </div><p>
  88. <a class="anchor" name="0583bbda2d13f0dd1cb751cd02f755d3"></a><!-- doxytag: member="maxflow_pp::~maxflow_pp" ref="0583bbda2d13f0dd1cb751cd02f755d3" args="()" -->
  89. <div class="memitem">
  90. <div class="memproto">
  91. <table class="memname">
  92. <tr>
  93. <td class="memname">virtual maxflow_pp::~maxflow_pp </td>
  94. <td>(</td>
  95. <td class="paramname"> </td>
  96. <td>&nbsp;)&nbsp;</td>
  97. <td width="100%"><code> [virtual]</code></td>
  98. </tr>
  99. </table>
  100. </div>
  101. <div class="memdoc">
  102. <p>
  103. Destructor.<p>
  104. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00001.html#dca9b1e7fa3afd914519a9dbb44e9fd5" title="Destroys the algorithm object.">algorithm::~algorithm</a> </dd></dl>
  105. </div>
  106. </div><p>
  107. <hr><h2>Member Function Documentation</h2>
  108. <a class="anchor" name="c77f4c613efe7857e053f9bfb103dc3e"></a><!-- doxytag: member="maxflow_pp::set_vars" ref="c77f4c613efe7857e053f9bfb103dc3e" args="(const edge_map&lt; double &gt; &amp;edge_capacity)" -->
  109. <div class="memitem">
  110. <div class="memproto">
  111. <table class="memname">
  112. <tr>
  113. <td class="memname">void maxflow_pp::set_vars </td>
  114. <td>(</td>
  115. <td class="paramtype">const <a class="el" href="a00011.html">edge_map</a>&lt; double &gt; &amp;&nbsp;</td>
  116. <td class="paramname"> <em>edge_capacity</em> </td>
  117. <td>&nbsp;)&nbsp;</td>
  118. <td width="100%"></td>
  119. </tr>
  120. </table>
  121. </div>
  122. <div class="memdoc">
  123. <p>
  124. Sets capacity of every <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> for maximum flow calculation where artificial start-node and end_node will be computed automatically.<p>
  125. <dl compact><dt><b>Parameters:</b></dt><dd>
  126. <table border="0" cellspacing="2" cellpadding="0">
  127. <tr><td valign="top"></td><td valign="top"><em>edge_capacity</em>&nbsp;</td><td>capacity of every <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> </td></tr>
  128. </table>
  129. </dl>
  130. </div>
  131. </div><p>
  132. <a class="anchor" name="13756f76387cc114b88a44e324fc93ae"></a><!-- doxytag: member="maxflow_pp::set_vars" ref="13756f76387cc114b88a44e324fc93ae" args="(const edge_map&lt; double &gt; &amp;edge_capacity, const node &amp;net_source, const node &amp;net_target)" -->
  133. <div class="memitem">
  134. <div class="memproto">
  135. <table class="memname">
  136. <tr>
  137. <td class="memname">void maxflow_pp::set_vars </td>
  138. <td>(</td>
  139. <td class="paramtype">const <a class="el" href="a00011.html">edge_map</a>&lt; double &gt; &amp;&nbsp;</td>
  140. <td class="paramname"> <em>edge_capacity</em>, </td>
  141. </tr>
  142. <tr>
  143. <td class="paramkey"></td>
  144. <td></td>
  145. <td class="paramtype">const <a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
  146. <td class="paramname"> <em>net_source</em>, </td>
  147. </tr>
  148. <tr>
  149. <td class="paramkey"></td>
  150. <td></td>
  151. <td class="paramtype">const <a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
  152. <td class="paramname"> <em>net_target</em></td><td>&nbsp;</td>
  153. </tr>
  154. <tr>
  155. <td></td>
  156. <td>)</td>
  157. <td></td><td></td><td width="100%"></td>
  158. </tr>
  159. </table>
  160. </div>
  161. <div class="memdoc">
  162. <p>
  163. Sets capacity of every <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> for maximum flow calculation<p>
  164. <dl compact><dt><b>Parameters:</b></dt><dd>
  165. <table border="0" cellspacing="2" cellpadding="0">
  166. <tr><td valign="top"></td><td valign="top"><em>edge_capacity</em>&nbsp;</td><td>capacity of every <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> </td></tr>
  167. <tr><td valign="top"></td><td valign="top"><em>net_source</em>&nbsp;</td><td>start-node </td></tr>
  168. <tr><td valign="top"></td><td valign="top"><em>net_target</em>&nbsp;</td><td>end-node </td></tr>
  169. </table>
  170. </dl>
  171. </div>
  172. </div><p>
  173. <a class="anchor" name="05bb51b4f7ab213b6624188a0e64a025"></a><!-- doxytag: member="maxflow_pp::check" ref="05bb51b4f7ab213b6624188a0e64a025" args="(graph &amp;G)" -->
  174. <div class="memitem">
  175. <div class="memproto">
  176. <table class="memname">
  177. <tr>
  178. <td class="memname">virtual int maxflow_pp::check </td>
  179. <td>(</td>
  180. <td class="paramtype"><a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
  181. <td class="paramname"> <em>G</em> </td>
  182. <td>&nbsp;)&nbsp;</td>
  183. <td width="100%"><code> [virtual]</code></td>
  184. </tr>
  185. </table>
  186. </div>
  187. <div class="memdoc">
  188. <p>
  189. Checks whether following preconditions are satisfied: <ul>
  190. <li>
  191. <a class="el" href="a00016.html#c77f4c613efe7857e053f9bfb103dc3e">maxflow_pp::set_vars</a> has been executed before. </li>
  192. <li>
  193. only edge_capacities &gt;= 0 are applied. </li>
  194. <li>
  195. <code>G</code> is directed. </li>
  196. <li>
  197. <code>G</code> is connected. </li>
  198. <li>
  199. <code>G</code> has at least one <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> and two nodes. </li>
  200. <li>
  201. if not applied, start-nodes and end-nodes exists. </li>
  202. <li>
  203. if applied, start-node is not the same <a class="el" href="a00020.html" title="A node in a graph.">node</a> as end-node. </li>
  204. </ul>
  205. <p>
  206. <dl compact><dt><b>Parameters:</b></dt><dd>
  207. <table border="0" cellspacing="2" cellpadding="0">
  208. <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>
  209. </table>
  210. </dl>
  211. <dl class="return" compact><dt><b>Returns:</b></dt><dd><code><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67105114c20e4a96a76b5de9f28bf15e282b">algorithm::GTL_OK</a></code> on success <code><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67106fcf574690bbd6cf710837a169510dd7">algorithm::GTL_ERROR</a></code> otherwise </dd></dl>
  212. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00001.html#76361fb03ad1cf643affc51821e43bed" title="Checks whether all preconditions are satisfied.">algorithm::check</a> </dd></dl>
  213. <p>Implements <a class="el" href="a00001.html#76361fb03ad1cf643affc51821e43bed">algorithm</a>.</p>
  214. </div>
  215. </div><p>
  216. <a class="anchor" name="07c7cb1ae5db23d87cf49ce7769b2814"></a><!-- doxytag: member="maxflow_pp::run" ref="07c7cb1ae5db23d87cf49ce7769b2814" args="(graph &amp;G)" -->
  217. <div class="memitem">
  218. <div class="memproto">
  219. <table class="memname">
  220. <tr>
  221. <td class="memname">int maxflow_pp::run </td>
  222. <td>(</td>
  223. <td class="paramtype"><a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
  224. <td class="paramname"> <em>G</em> </td>
  225. <td>&nbsp;)&nbsp;</td>
  226. <td width="100%"><code> [virtual]</code></td>
  227. </tr>
  228. </table>
  229. </div>
  230. <div class="memdoc">
  231. <p>
  232. Computes maximum flow of <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> <code>G</code>.<p>
  233. <dl compact><dt><b>Parameters:</b></dt><dd>
  234. <table border="0" cellspacing="2" cellpadding="0">
  235. <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>
  236. </table>
  237. </dl>
  238. <dl class="return" compact><dt><b>Returns:</b></dt><dd><code><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67105114c20e4a96a76b5de9f28bf15e282b">algorithm::GTL_OK</a></code> on success <code><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67106fcf574690bbd6cf710837a169510dd7">algorithm::GTL_ERROR</a></code> otherwise </dd></dl>
  239. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00001.html#734b189509a8d6b56b65f8ff772d43ca" title="Applies algorithm to graph g.">algorithm::run</a> </dd></dl>
  240. <p>Implements <a class="el" href="a00001.html#734b189509a8d6b56b65f8ff772d43ca">algorithm</a>.</p>
  241. </div>
  242. </div><p>
  243. <a class="anchor" name="aa7c72c190ce34a6645b80999b096a74"></a><!-- doxytag: member="maxflow_pp::get_max_flow" ref="aa7c72c190ce34a6645b80999b096a74" args="(const edge &amp;e) const " -->
  244. <div class="memitem">
  245. <div class="memproto">
  246. <table class="memname">
  247. <tr>
  248. <td class="memname">double maxflow_pp::get_max_flow </td>
  249. <td>(</td>
  250. <td class="paramtype">const <a class="el" href="a00010.html">edge</a> &amp;&nbsp;</td>
  251. <td class="paramname"> <em>e</em> </td>
  252. <td>&nbsp;)&nbsp;</td>
  253. <td width="100%"> const</td>
  254. </tr>
  255. </table>
  256. </div>
  257. <div class="memdoc">
  258. <p>
  259. Returns the maximum flow of an <a class="el" href="a00010.html" title="An edge in a graph.">edge</a>.<p>
  260. <dl compact><dt><b>Parameters:</b></dt><dd>
  261. <table border="0" cellspacing="2" cellpadding="0">
  262. <tr><td valign="top"></td><td valign="top"><em>e</em>&nbsp;</td><td><a class="el" href="a00010.html" title="An edge in a graph.">edge</a> of a <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> <code>G</code> </td></tr>
  263. </table>
  264. </dl>
  265. <dl class="return" compact><dt><b>Returns:</b></dt><dd>maximum flow value </dd></dl>
  266. </div>
  267. </div><p>
  268. <a class="anchor" name="e94e30257b7e9db479d4c2d2d5d1095e"></a><!-- doxytag: member="maxflow_pp::get_max_flow" ref="e94e30257b7e9db479d4c2d2d5d1095e" args="() const " -->
  269. <div class="memitem">
  270. <div class="memproto">
  271. <table class="memname">
  272. <tr>
  273. <td class="memname">double maxflow_pp::get_max_flow </td>
  274. <td>(</td>
  275. <td class="paramname"> </td>
  276. <td>&nbsp;)&nbsp;</td>
  277. <td width="100%"> const</td>
  278. </tr>
  279. </table>
  280. </div>
  281. <div class="memdoc">
  282. <p>
  283. Returns the maximum flow of the whole <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> <code>G</code>.<p>
  284. <dl class="return" compact><dt><b>Returns:</b></dt><dd>maximum flow value </dd></dl>
  285. </div>
  286. </div><p>
  287. <a class="anchor" name="bf0163c72a53b8af0c48580e156e880c"></a><!-- doxytag: member="maxflow_pp::get_rem_cap" ref="bf0163c72a53b8af0c48580e156e880c" args="(const edge &amp;e) const " -->
  288. <div class="memitem">
  289. <div class="memproto">
  290. <table class="memname">
  291. <tr>
  292. <td class="memname">double maxflow_pp::get_rem_cap </td>
  293. <td>(</td>
  294. <td class="paramtype">const <a class="el" href="a00010.html">edge</a> &amp;&nbsp;</td>
  295. <td class="paramname"> <em>e</em> </td>
  296. <td>&nbsp;)&nbsp;</td>
  297. <td width="100%"> const</td>
  298. </tr>
  299. </table>
  300. </div>
  301. <div class="memdoc">
  302. <p>
  303. Returns the remaining free capacity of an <a class="el" href="a00010.html" title="An edge in a graph.">edge</a>.<p>
  304. <dl compact><dt><b>Parameters:</b></dt><dd>
  305. <table border="0" cellspacing="2" cellpadding="0">
  306. <tr><td valign="top"></td><td valign="top"><em>e</em>&nbsp;</td><td><a class="el" href="a00010.html" title="An edge in a graph.">edge</a> of a <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> G </td></tr>
  307. </table>
  308. </dl>
  309. <dl class="return" compact><dt><b>Returns:</b></dt><dd>remaining capacity </dd></dl>
  310. </div>
  311. </div><p>
  312. <a class="anchor" name="039b1c893b2197a1f3fe0586c2d3e802"></a><!-- doxytag: member="maxflow_pp::reset" ref="039b1c893b2197a1f3fe0586c2d3e802" args="()" -->
  313. <div class="memitem">
  314. <div class="memproto">
  315. <table class="memname">
  316. <tr>
  317. <td class="memname">virtual void maxflow_pp::reset </td>
  318. <td>(</td>
  319. <td class="paramname"> </td>
  320. <td>&nbsp;)&nbsp;</td>
  321. <td width="100%"><code> [virtual]</code></td>
  322. </tr>
  323. </table>
  324. </div>
  325. <div class="memdoc">
  326. <p>
  327. Resets maximum flow <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a>, i.e. prepares the <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> to be applied to another <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>. <dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00001.html#21aba63d066ae7897de6ca7d8425c408" title="Resets algorithm.">algorithm::reset</a> </dd></dl>
  328. <p>Implements <a class="el" href="a00001.html#21aba63d066ae7897de6ca7d8425c408">algorithm</a>.</p>
  329. </div>
  330. </div><p>
  331. <p class="links">
  332. <a href="http://www.uni-passau.de/">University of Passau</a>
  333. &nbsp;-&nbsp;
  334. <a href="http://www.fmi.uni-passau.de/">FMI</a>
  335. &nbsp;-&nbsp;
  336. <a href="http://www.fmi.uni-passau.de/fmi/lehrstuehle/brandenburg/">Theoretical
  337. Computer Science</a>
  338. </p>
  339. <div class="copyright">
  340. Design &copy; 2002, 2003 <a href="mailto:raitner@fmi.uni-passau.de">Marcus Raitner</a>, University of Passau
  341. </div>
  342. </body>
  343. </html>