mooigraph
/
regraphlet


			
				
					
						
						
							123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386
							<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html>
  <head>
    <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
      <title>GTL - Graph Template Library: maxflow_sap Class Reference</title>
      <link href="doxygen.css" rel="stylesheet" type="text/css">
  </head>
  <body>
    <p class="links">  
      <a href="../index.html">Home</a> |
      Documentation |
      <a href="../register.html">Download</a> |
      <a href="../platforms.html">Platforms</a> |
      <a href="../refer.html">Projects</a> |      
      <a href="../lists.html">Mailing Lists</a> |
      <a href="../history.html">Version History</a>
    </p>

<!-- Generated by Doxygen 1.5.3 -->
<div class="tabs">
  <ul>
    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
    <li class="current"><a href="classes.html"><span>Classes</span></a></li>
    <li><a href="files.html"><span>Files</span></a></li>
    <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  </ul>
</div>
<div class="tabs">
  <ul>
    <li><a href="classes.html"><span>Alphabetical&nbsp;List</span></a></li>
    <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
    <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
    <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
  </ul>
</div>
<h1>maxflow_sap Class Reference</h1><!-- doxytag: class="maxflow_sap" --><!-- doxytag: inherits="algorithm" -->Maximum flow <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> with shortest augmenting paths.  
<a href="#_details">More...</a>
<p>
<div class="dynheader">
Inheritance diagram for maxflow_sap:</div>
<div class="dynsection">
<p><center><img src="a00164.gif" border="0" usemap="#a00165" alt="Inheritance graph"></center>
<map name="a00165">
<area shape="rect" href="a00001.html" title="Abstract baseclass for all algoritm&#45;classes." alt="" coords="16,7,93,31"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
<div class="dynheader">
Collaboration diagram for maxflow_sap:</div>
<div class="dynsection">
<p><center><img src="a00166.gif" border="0" usemap="#a00167" alt="Collaboration graph"></center>
<map name="a00167">
<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,103,497,111"><area shape="rect" title="net_source\nnet_target" alt="" coords="725,164,733,172"><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="a00021.html" title="node_map\&lt; int \&gt;" alt="" coords="405,140,528,164"><area shape="rect" title="dist_label" alt="" coords="524,155,532,163"><area shape="rect" title="dist_label" alt="" coords="696,171,704,179"><area shape="rect" href="a00019.html" title="ne_map\&lt; node, int, graph, allocator\&lt; int \&gt; \&gt;" alt="" coords="32,140,315,164"><area shape="rect" href="a00011.html" title="edge_map\&lt; double \&gt;" alt="" coords="392,196,541,220"><area shape="rect" title="edge_max_flow\nedge_capacity" alt="" coords="537,211,545,219"><area shape="rect" title="edge_max_flow\nedge_capacity" alt="" coords="719,189,727,197"><area shape="rect" href="a00019.html" title="ne_map\&lt; edge, double, graph, allocator\&lt; double \&gt; \&gt;" alt="" coords="7,196,340,220"><area shape="rect" href="a00011.html" title="edge_map\&lt; edge \&gt;" alt="" coords="397,244,536,268"><area shape="rect" title="back_edge" alt="" coords="532,256,540,264"><area shape="rect" title="back_edge" alt="" coords="733,189,741,197"><area shape="rect" href="a00019.html" title="ne_map\&lt; edge, edge, graph, allocator\&lt; edge \&gt; \&gt;" alt="" coords="16,244,331,268"><area shape="rect" href="a00011.html" title="edge_map\&lt; bool \&gt;" alt="" coords="400,303,533,327"><area shape="rect" title="edge_org\nback_edge_exists" alt="" coords="531,319,539,327"><area shape="rect" title="edge_org\nback_edge_exists" alt="" coords="741,189,749,197"><area shape="rect" href="a00019.html" title="ne_map\&lt; edge, bool, graph, allocator\&lt; bool \&gt; \&gt;" alt="" coords="21,303,325,327"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>

<p>
<a href="a00168.html">List of all members.</a><table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00017.html#d10178be6ae1050c713e192937bbdc8b">maxflow_sap</a> ()</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00017.html#66e9c3b70dee37a7c8d8d728b4331be0">~maxflow_sap</a> ()</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00017.html#c50ba0330c169c7ce697947a76702e13">set_vars</a> (const <a class="el" href="a00011.html">edge_map</a>&lt; double &gt; &amp;edge_capacity)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00017.html#936f6afa25de80046c7bd69dc47fdfa9">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>

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

<tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00017.html#b4305a2bb370ad9c43cc68d339b2dda0">run</a> (<a class="el" href="a00014.html">graph</a> &amp;G)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">double&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00017.html#590b1f80b82f09d555ca297b210b1f26">get_max_flow</a> (const <a class="el" href="a00010.html">edge</a> &amp;e) const </td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">double&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00017.html#e2cfd282ab946ea39c5b36c59683f6cd">get_max_flow</a> () const </td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">double&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00017.html#396e9ebda36d04f00f646ae02cabded3">get_rem_cap</a> (const <a class="el" href="a00010.html">edge</a> &amp;e) const </td></tr>

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

</table>
<hr><a name="_details"></a><h2>Detailed Description</h2>
Maximum flow <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> with shortest augmenting paths. 
<p>
This class implements a maximum flow <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> with shortest augmenting paths due to Ahuja and Orlin.<p>
In the case V is the set of vertices and E is the set of edges of the <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>, the <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> needs O(|V| * |V| * |E|) time to proceed.<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00015.html" title="Maximum flow algorithm (Edmonds-Karp).">maxflow_ff</a> <p>
<a class="el" href="a00016.html" title="Maximum flow algorithm (Malhotra, Kumar, Maheshwari).">maxflow_pp</a> </dd></dl>
<hr><h2>Constructor &amp; Destructor Documentation</h2>
<a class="anchor" name="d10178be6ae1050c713e192937bbdc8b"></a><!-- doxytag: member="maxflow_sap::maxflow_sap" ref="d10178be6ae1050c713e192937bbdc8b" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">maxflow_sap::maxflow_sap           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Default constructor. Enables only the calculation of maximum flow.<p>
<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>

</div>
</div><p>
<a class="anchor" name="66e9c3b70dee37a7c8d8d728b4331be0"></a><!-- doxytag: member="maxflow_sap::~maxflow_sap" ref="66e9c3b70dee37a7c8d8d728b4331be0" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">virtual maxflow_sap::~maxflow_sap           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [virtual]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Destructor.<p>
<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>

</div>
</div><p>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="c50ba0330c169c7ce697947a76702e13"></a><!-- doxytag: member="maxflow_sap::set_vars" ref="c50ba0330c169c7ce697947a76702e13" args="(const edge_map&lt; double &gt; &amp;edge_capacity)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void maxflow_sap::set_vars           </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="a00011.html">edge_map</a>&lt; double &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>edge_capacity</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
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>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <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>
  </table>
</dl>

</div>
</div><p>
<a class="anchor" name="936f6afa25de80046c7bd69dc47fdfa9"></a><!-- doxytag: member="maxflow_sap::set_vars" ref="936f6afa25de80046c7bd69dc47fdfa9" args="(const edge_map&lt; double &gt; &amp;edge_capacity, const node &amp;net_source, const node &amp;net_target)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void maxflow_sap::set_vars           </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="a00011.html">edge_map</a>&lt; double &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>edge_capacity</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>net_source</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>net_target</em></td><td>&nbsp;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td><td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Sets capacity of every <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> for maximum flow calculation<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <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>
    <tr><td valign="top"></td><td valign="top"><em>net_source</em>&nbsp;</td><td>start-node </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>net_target</em>&nbsp;</td><td>end-node </td></tr>
  </table>
</dl>

</div>
</div><p>
<a class="anchor" name="f94644633a5cfb386de082cc02febef3"></a><!-- doxytag: member="maxflow_sap::check" ref="f94644633a5cfb386de082cc02febef3" args="(graph &amp;G)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">virtual int maxflow_sap::check           </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>G</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [virtual]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Checks whether following preconditions are satisfied: <ul>
<li>
<a class="el" href="a00017.html#c50ba0330c169c7ce697947a76702e13">maxflow_sap::set_vars</a> has been executed before. </li>
<li>
only edge_capacities &gt;= 0 are applied. </li>
<li>
<code>G</code> is directed. </li>
<li>
<code>G</code> is connected. </li>
<li>
<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>
<li>
if not applied, start-nodes and end-nodes exists. </li>
<li>
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>
</ul>
<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <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>
  </table>
</dl>
<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>
<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>

<p>Implements <a class="el" href="a00001.html#76361fb03ad1cf643affc51821e43bed">algorithm</a>.</p>

</div>
</div><p>
<a class="anchor" name="b4305a2bb370ad9c43cc68d339b2dda0"></a><!-- doxytag: member="maxflow_sap::run" ref="b4305a2bb370ad9c43cc68d339b2dda0" args="(graph &amp;G)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int maxflow_sap::run           </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>G</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [virtual]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Computes maximum flow of <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> <code>G</code>.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <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>
  </table>
</dl>
<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>
<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>

<p>Implements <a class="el" href="a00001.html#734b189509a8d6b56b65f8ff772d43ca">algorithm</a>.</p>

</div>
</div><p>
<a class="anchor" name="590b1f80b82f09d555ca297b210b1f26"></a><!-- doxytag: member="maxflow_sap::get_max_flow" ref="590b1f80b82f09d555ca297b210b1f26" args="(const edge &amp;e) const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">double maxflow_sap::get_max_flow           </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="a00010.html">edge</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>e</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns the maximum flow of an <a class="el" href="a00010.html" title="An edge in a graph.">edge</a>.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <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>
  </table>
</dl>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>maximum flow value </dd></dl>

</div>
</div><p>
<a class="anchor" name="e2cfd282ab946ea39c5b36c59683f6cd"></a><!-- doxytag: member="maxflow_sap::get_max_flow" ref="e2cfd282ab946ea39c5b36c59683f6cd" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">double maxflow_sap::get_max_flow           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns the maximum flow of the whole <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> G.<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>maximum flow value </dd></dl>

</div>
</div><p>
<a class="anchor" name="396e9ebda36d04f00f646ae02cabded3"></a><!-- doxytag: member="maxflow_sap::get_rem_cap" ref="396e9ebda36d04f00f646ae02cabded3" args="(const edge &amp;e) const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">double maxflow_sap::get_rem_cap           </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="a00010.html">edge</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>e</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns the remaining free capacity of an <a class="el" href="a00010.html" title="An edge in a graph.">edge</a>.<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <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>
  </table>
</dl>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>remaining capacity </dd></dl>

</div>
</div><p>
<a class="anchor" name="6c35136743e38cee6c31e18cf8ca20be"></a><!-- doxytag: member="maxflow_sap::reset" ref="6c35136743e38cee6c31e18cf8ca20be" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">virtual void maxflow_sap::reset           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [virtual]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
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>.<p>
<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>

<p>Implements <a class="el" href="a00001.html#21aba63d066ae7897de6ca7d8425c408">algorithm</a>.</p>

</div>
</div><p>
    <p class="links">
      <a href="http://www.uni-passau.de/">University of Passau</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/">FMI</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/fmi/lehrstuehle/brandenburg/">Theoretical
	Computer Science</a>
    </p>
  <div class="copyright">
      Design &copy; 2002, 2003 <a href="mailto:raitner@fmi.uni-passau.de">Marcus Raitner</a>,  University of Passau 
  </div>
</body>
</html>