mooigraph
/
regraphlet


			
				
					
						
						
							123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440
							<!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: st_number 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>st_number Class Reference</h1><!-- doxytag: class="st_number" --><!-- doxytag: inherits="algorithm" -->ST-number <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a>.  
<a href="#_details">More...</a>
<p>
<div class="dynheader">
Inheritance diagram for st_number:</div>
<div class="dynsection">
<p><center><img src="a00199.gif" border="0" usemap="#a00200" alt="Inheritance graph"></center>
<map name="a00200">
<area shape="rect" href="a00001.html" title="Abstract baseclass for all algoritm&#45;classes." alt="" coords="9,7,87,31"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
<div class="dynheader">
Collaboration diagram for st_number:</div>
<div class="dynsection">
<p><center><img src="a00201.gif" border="0" usemap="#a00202" alt="Collaboration graph"></center>
<map name="a00202">
<area shape="rect" href="a00001.html" title="Abstract baseclass for all algoritm&#45;classes." alt="" coords="5,84,83,108"><area shape="rect" href="a00020.html" title="A node in a graph." alt="" coords="107,84,157,108"><area shape="rect" title="s" alt="" coords="141,105,149,113"><area shape="rect" title="s" alt="" coords="209,171,217,179"><area shape="rect" title="int_node" alt="" coords="147,80,155,88"><area shape="rect" title="int_node" alt="" coords="152,105,160,113"><area shape="rect" href="a00021.html" title="node_map\&lt; int \&gt;" alt="" coords="257,84,380,108"><area shape="rect" title="st_num" alt="" coords="301,105,309,113"><area shape="rect" title="st_num" alt="" coords="233,171,241,179"><area shape="rect" href="a00019.html" title="ne_map\&lt; node, int, graph, allocator\&lt; int \&gt; \&gt;" alt="" coords="177,7,460,31"><area shape="rect" href="a00010.html" title="An edge in a graph." alt="" coords="404,84,455,108"><area shape="rect" title="st" alt="" coords="404,105,412,113"><area shape="rect" title="st" alt="" coords="263,171,271,179"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>

<p>
<a href="a00203.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"><a class="anchor" name="07532323fbcc643dfc419809385b64a7"></a><!-- doxytag: member="st_number::st_number" ref="07532323fbcc643dfc419809385b64a7" args="()" -->
&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00026.html#07532323fbcc643dfc419809385b64a7">st_number</a> ()</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Default constructor. Creates st-number object. Please note that there are no reasonable default settings for the parameters, i.e. the <a class="el" href="a00010.html" title="An edge in a graph.">edge</a>  st connecting the lowest with highest numbers <a class="el" href="a00020.html" title="A node in a graph.">node</a> and which of its endpoints should get number 1 (= <a class="el" href="a00020.html" title="A node in a graph.">node</a> <em>s</em>) has to be specified always. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="4f3a2a6ceab39d106c920ee3546c259d"></a><!-- doxytag: member="st_number::~st_number" ref="4f3a2a6ceab39d106c920ee3546c259d" args="()" -->
virtual&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00026.html#4f3a2a6ceab39d106c920ee3546c259d">~st_number</a> ()</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Destructor. <br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00026.html#1564af6f603160105643f22bf2f6955b">st_edge</a> (<a class="el" href="a00010.html">edge</a> e)</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Sets <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> <em>st</em> for the next run.  <a href="#1564af6f603160105643f22bf2f6955b"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00010.html">edge</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00026.html#58fc3b24be01d7b06fd4b6f94340e1c3">st_edge</a> () const </td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Get <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> <em>st</em>.  <a href="#58fc3b24be01d7b06fd4b6f94340e1c3"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00026.html#a607c9aaa5a4d9c45e5854ce672f0fda">s_node</a> (<a class="el" href="a00020.html">node</a> n)</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Sets <a class="el" href="a00020.html" title="A node in a graph.">node</a> <em>s</em> for next run.  <a href="#a607c9aaa5a4d9c45e5854ce672f0fda"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00020.html">node</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00026.html#48e4837ebed88445c1f594024d8753dc">s_node</a> () const </td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Get <a class="el" href="a00020.html" title="A node in a graph.">node</a> <em>s</em>.  <a href="#48e4837ebed88445c1f594024d8753dc"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">int &amp;&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00026.html#969162a10da5daba4219419d45c4be51">operator[]</a> (const <a class="el" href="a00020.html">node</a> &amp;n)</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Returns st-number of <a class="el" href="a00020.html" title="A node in a graph.">node</a> <code>n</code> as determined in the last run.  <a href="#969162a10da5daba4219419d45c4be51"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00026.html#1eddb2577b16109d22cde98a8ffde057">begin</a> ()</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Iteration through the nodes of <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> st-numbered in last run in st-number order, i.e. from 1 to highest st-number.  <a href="#1eddb2577b16109d22cde98a8ffde057"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00026.html#3912b83a8cbddcb1fc804d20be528d52">end</a> ()</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Iteration through nodes of <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> in st-number order.  <a href="#3912b83a8cbddcb1fc804d20be528d52"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">reverse_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00026.html#56f2c67e9b49362947fe0c99278f6d31">rbegin</a> ()</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Iteration through the nodes of <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> st-numbered in last run in reverse st-number order, i.e. from highest st-number down to 1.  <a href="#56f2c67e9b49362947fe0c99278f6d31"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">reverse_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00026.html#4c5fdce6ab2be7ee9ddbb09e8d5c8560">rend</a> ()</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">End of iteration through nodes of <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> in reverse st-number order.  <a href="#4c5fdce6ab2be7ee9ddbb09e8d5c8560"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00026.html#2aad4550b821c52d6998bff35fd8648f">check</a> (<a class="el" href="a00014.html">graph</a> &amp;G)</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Checks whether st-number <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> can be applied to <code>G</code>.  <a href="#2aad4550b821c52d6998bff35fd8648f"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00026.html#f902a0c05d07d47b587e8f7a6b7beaa1">run</a> (<a class="el" href="a00014.html">graph</a> &amp;G)</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Runs st-number <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> on <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> <code>G</code>.  <a href="#f902a0c05d07d47b587e8f7a6b7beaa1"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00026.html#e6f86706b8ae3495d3794b8c684fff0f">reset</a> ()</td></tr>

<tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">Resets <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> in order to be applied to the next <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>.  <a href="#e6f86706b8ae3495d3794b8c684fff0f"></a><br></td></tr>
</table>
<hr><a name="_details"></a><h2>Detailed Description</h2>
ST-number <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a>. 
<p>
Encapsulates the st-number <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> together with all the data produced by it. <p>
Assigns an integer <code>st[n]</code> to each <a class="el" href="a00020.html" title="A node in a graph.">node</a> <code>n</code> of a undirected, biconnected <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>, such that each <a class="el" href="a00020.html" title="A node in a graph.">node</a> is connected with at least one <a class="el" href="a00020.html" title="A node in a graph.">node</a> having a smaller and with at least one having a larger number than itself. The only exception to this rule are the endpoints of <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> <em>st</em> connecting nodes <em>s</em> (st-number 1) and <code>t</code> (highest st-number). <p>
The following options are supported:<ul>
<li><a class="el" href="a00026.html#1564af6f603160105643f22bf2f6955b" title="Sets edge st for the next run.">st_edge</a> sets/retrieves the <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> that connects the <a class="el" href="a00020.html" title="A node in a graph.">node</a> with the lowest number to that with the highest.</li><li><a class="el" href="a00026.html#a607c9aaa5a4d9c45e5854ce672f0fda" title="Sets node s for next run.">s_node</a> sets/retrieves that endpoints of the <em>st_edge</em>, which gets number 1. </li></ul>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="1564af6f603160105643f22bf2f6955b"></a><!-- doxytag: member="st_number::st_edge" ref="1564af6f603160105643f22bf2f6955b" args="(edge e)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void st_number::st_edge           </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="a00010.html">edge</a>&nbsp;</td>
          <td class="paramname"> <em>e</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Sets <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> <em>st</em> for the next run. 
<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> <em>st</em> </td></tr>
  </table>
</dl>

</div>
</div><p>
<a class="anchor" name="58fc3b24be01d7b06fd4b6f94340e1c3"></a><!-- doxytag: member="st_number::st_edge" ref="58fc3b24be01d7b06fd4b6f94340e1c3" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00010.html">edge</a> st_number::st_edge           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const<code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Get <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> <em>st</em>. 
<p>
<dl compact><dt><b>Return values:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em><a class="el" href="a00010.html" title="An edge in a graph.">edge</a></em>&nbsp;</td><td><em>st</em> </td></tr>
  </table>
</dl>

</div>
</div><p>
<a class="anchor" name="a607c9aaa5a4d9c45e5854ce672f0fda"></a><!-- doxytag: member="st_number::s_node" ref="a607c9aaa5a4d9c45e5854ce672f0fda" args="(node n)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void st_number::s_node           </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="a00020.html">node</a>&nbsp;</td>
          <td class="paramname"> <em>n</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Sets <a class="el" href="a00020.html" title="A node in a graph.">node</a> <em>s</em> for next run. 
<p>
This must be one of the endpoints of <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> <em>st</em>. This <a class="el" href="a00020.html" title="A node in a graph.">node</a> will get st-number 1 and thus the other endpoint will get the highest st-number.<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>n</em>&nbsp;</td><td><a class="el" href="a00020.html" title="A node in a graph.">node</a> <em>s</em> </td></tr>
  </table>
</dl>

</div>
</div><p>
<a class="anchor" name="48e4837ebed88445c1f594024d8753dc"></a><!-- doxytag: member="st_number::s_node" ref="48e4837ebed88445c1f594024d8753dc" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00020.html">node</a> st_number::s_node           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const<code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Get <a class="el" href="a00020.html" title="A node in a graph.">node</a> <em>s</em>. 
<p>
<dl compact><dt><b>Return values:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em><a class="el" href="a00020.html" title="A node in a graph.">node</a></em>&nbsp;</td><td><em>s</em> </td></tr>
  </table>
</dl>

</div>
</div><p>
<a class="anchor" name="969162a10da5daba4219419d45c4be51"></a><!-- doxytag: member="st_number::operator[]" ref="969162a10da5daba4219419d45c4be51" args="(const node &amp;n)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int&amp; st_number::operator[]           </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="a00020.html">node</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>n</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Returns st-number of <a class="el" href="a00020.html" title="A node in a graph.">node</a> <code>n</code> as determined in the last run. 
<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>n</em>&nbsp;</td><td><a class="el" href="a00020.html" title="A node in a graph.">node</a></td></tr>
  </table>
</dl>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>st-number of <code>n</code> </dd></dl>

</div>
</div><p>
<a class="anchor" name="1eddb2577b16109d22cde98a8ffde057"></a><!-- doxytag: member="st_number::begin" ref="1eddb2577b16109d22cde98a8ffde057" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">iterator st_number::begin           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Iteration through the nodes of <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> st-numbered in last run in st-number order, i.e. from 1 to highest st-number. 
<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>start of iteration through nodes in st-number order </dd></dl>

</div>
</div><p>
<a class="anchor" name="3912b83a8cbddcb1fc804d20be528d52"></a><!-- doxytag: member="st_number::end" ref="3912b83a8cbddcb1fc804d20be528d52" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">iterator st_number::end           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Iteration through nodes of <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> in st-number order. 
<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>end of iteration through nodes of <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> in st-number order </dd></dl>

</div>
</div><p>
<a class="anchor" name="56f2c67e9b49362947fe0c99278f6d31"></a><!-- doxytag: member="st_number::rbegin" ref="56f2c67e9b49362947fe0c99278f6d31" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">reverse_iterator st_number::rbegin           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Iteration through the nodes of <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> st-numbered in last run in reverse st-number order, i.e. from highest st-number down to 1. 
<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>start of iteration through nodes in reverse st-number order </dd></dl>

</div>
</div><p>
<a class="anchor" name="4c5fdce6ab2be7ee9ddbb09e8d5c8560"></a><!-- doxytag: member="st_number::rend" ref="4c5fdce6ab2be7ee9ddbb09e8d5c8560" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">reverse_iterator st_number::rend           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [inline]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
End of iteration through nodes of <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> in reverse st-number order. 
<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>end of iteration through nodes in reverse st-number order </dd></dl>

</div>
</div><p>
<a class="anchor" name="2aad4550b821c52d6998bff35fd8648f"></a><!-- doxytag: member="st_number::check" ref="2aad4550b821c52d6998bff35fd8648f" args="(graph &amp;G)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int st_number::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 st-number <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> can be applied to <code>G</code>. 
<p>
Besides from the trivial preconditions that <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> <em>st</em> and <a class="el" href="a00020.html" title="A node in a graph.">node</a> <em>s</em> lie in <code>G</code> and <em>s</em> is really an endpoint of <em>st</em> (which isn't checked), <code>G</code> must be undirected and biconnected. <dl class="note" compact><dt><b>Note:</b></dt><dd>As for all algorithms in GTL, <a class="el" href="a00026.html#2aad4550b821c52d6998bff35fd8648f" title="Checks whether st-number algorithm can be applied to G.">check</a> must be called, because it might do some initialization.</dd></dl>
<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 compact><dt><b>Return values:</b></dt><dd>
  <table border="0" cellspacing="2" cellpadding="0">
    <tr><td valign="top"></td><td valign="top"><em><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67105114c20e4a96a76b5de9f28bf15e282b">algorithm::GTL_OK</a></em>&nbsp;</td><td>iff st-number <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> may be applied</td></tr>
  </table>
</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="f902a0c05d07d47b587e8f7a6b7beaa1"></a><!-- doxytag: member="st_number::run" ref="f902a0c05d07d47b587e8f7a6b7beaa1" args="(graph &amp;G)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int st_number::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>
Runs st-number <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> on <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> <code>G</code>. 
<p>
It is assumed that <a class="el" href="a00026.html#2aad4550b821c52d6998bff35fd8648f" title="Checks whether st-number algorithm can be applied to G.">check</a> was called previously and returned <a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67105114c20e4a96a76b5de9f28bf15e282b">algorithm::GTL_OK</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>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><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67105114c20e4a96a76b5de9f28bf15e282b">algorithm::GTL_OK</a> iff <code>G</code> could be correctly st-numbered</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="e6f86706b8ae3495d3794b8c684fff0f"></a><!-- doxytag: member="st_number::reset" ref="e6f86706b8ae3495d3794b8c684fff0f" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void st_number::reset           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"><code> [inline, virtual]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Resets <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> in order to be applied to the next <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a>. 
<p>
This will delete most of the information obtained in the last run.<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>