mooigraph
/
regraphlet


			
				
					
						
						
							1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
							<!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: Member List</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 Member List</h1>This is the complete list of members for <a class="el" href="a00026.html">st_number</a>, including all inherited members.<p><table>
  <tr class="memlist"><td><a class="el" href="a00001.html#b79e1ddec2f2afdf4b36b10724db8b15">algorithm</a>()</td><td><a class="el" href="a00001.html">algorithm</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00026.html#1eddb2577b16109d22cde98a8ffde057">begin</a>()</td><td><a class="el" href="a00026.html">st_number</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00026.html#2aad4550b821c52d6998bff35fd8648f">check</a>(graph &amp;G)</td><td><a class="el" href="a00026.html">st_number</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00026.html#3912b83a8cbddcb1fc804d20be528d52">end</a>()</td><td><a class="el" href="a00026.html">st_number</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67106fcf574690bbd6cf710837a169510dd7">GTL_ERROR</a> enum value</td><td><a class="el" href="a00001.html">algorithm</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#f1a0078e153aa99c24f9bdf0d97f67105114c20e4a96a76b5de9f28bf15e282b">GTL_OK</a> enum value</td><td><a class="el" href="a00001.html">algorithm</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00026.html#969162a10da5daba4219419d45c4be51">operator[]</a>(const node &amp;n)</td><td><a class="el" href="a00026.html">st_number</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00026.html#56f2c67e9b49362947fe0c99278f6d31">rbegin</a>()</td><td><a class="el" href="a00026.html">st_number</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00026.html#4c5fdce6ab2be7ee9ddbb09e8d5c8560">rend</a>()</td><td><a class="el" href="a00026.html">st_number</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00026.html#e6f86706b8ae3495d3794b8c684fff0f">reset</a>()</td><td><a class="el" href="a00026.html">st_number</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00026.html#f902a0c05d07d47b587e8f7a6b7beaa1">run</a>(graph &amp;G)</td><td><a class="el" href="a00026.html">st_number</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00026.html#a607c9aaa5a4d9c45e5854ce672f0fda">s_node</a>(node n)</td><td><a class="el" href="a00026.html">st_number</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00026.html#48e4837ebed88445c1f594024d8753dc">s_node</a>() const </td><td><a class="el" href="a00026.html">st_number</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00026.html#1564af6f603160105643f22bf2f6955b">st_edge</a>(edge e)</td><td><a class="el" href="a00026.html">st_number</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00026.html#58fc3b24be01d7b06fd4b6f94340e1c3">st_edge</a>() const </td><td><a class="el" href="a00026.html">st_number</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00026.html#07532323fbcc643dfc419809385b64a7">st_number</a>()</td><td><a class="el" href="a00026.html">st_number</a></td><td><code> [inline]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00001.html#dca9b1e7fa3afd914519a9dbb44e9fd5">~algorithm</a>()</td><td><a class="el" href="a00001.html">algorithm</a></td><td><code> [inline, virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00026.html#4f3a2a6ceab39d106c920ee3546c259d">~st_number</a>()</td><td><a class="el" href="a00026.html">st_number</a></td><td><code> [inline, virtual]</code></td></tr>
</table>    <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>