mooigraph
/
regraphlet


			
				
					
						
						
							1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586
							<!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>fm_partition Member List</h1>This is the complete list of members for <a class="el" href="a00012.html">fm_partition</a>, including all inherited members.<p><table>
  <tr class="memlist"><td><a class="el" href="a00012.html#14f3549e41c99cec77c643f0b7bbebeb">A</a></td><td><a class="el" href="a00012.html">fm_partition</a></td><td><code> [static]</code></td></tr>
  <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="a00012.html#88a3757f1b287218977618640e34dbf6">B</a></td><td><a class="el" href="a00012.html">fm_partition</a></td><td><code> [static]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#21f4498904415ef1d88354517e7be95e">check</a>(graph &amp;G)</td><td><a class="el" href="a00012.html">fm_partition</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#9757161ed8cf175c0f5c4857fa3adea3">cut_edges_begin</a>() const </td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#f0ec3c073e6e2d978ac74b49f18f8322">cut_edges_end</a>() const </td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#ede10aea3dda6be8014ce60fca728efe">cut_edges_iterator</a> typedef</td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#63693cd93d587dca3d1842f831cd1c55">fix_type</a> typedef</td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#9d46a0a260c01dcf9746bf174694f026">FIXA</a></td><td><a class="el" href="a00012.html">fm_partition</a></td><td><code> [static]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#9c5ae8bac2a663c7574960c679ec7aa8">FIXB</a></td><td><a class="el" href="a00012.html">fm_partition</a></td><td><code> [static]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#69f37c22abf6df5b3778623512240106">fm_partition</a>()</td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#42fa2e19fb3fde093a1a05d0bd6d8ad1">get_cutsize</a>()</td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#a8aa84286a6939d17175fbf646ba3176">get_needed_passes</a>()</td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#76dfe2b3255d0484ee49db6c5e16923f">get_side_of_node</a>(const node &amp;n) const </td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#6bdf4a14624aaa3edcce7a3285b0051f">get_weight_on_sideA</a>(const graph &amp;G) const </td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#c749b2970f79abe84aa5890617cfc399">get_weight_on_sideB</a>(const graph &amp;G) const </td><td><a class="el" href="a00012.html">fm_partition</a></td><td></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="a00012.html#c8b7b5253476118e5f7bbad2fe8af285">nodes_of_one_side_iterator</a> typedef</td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#c2ea5bf5bc852214539c2ba153ffbccd">nodes_of_sideA_begin</a>() const </td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#19271aea3db04683627101e5cfd5af1f">nodes_of_sideA_end</a>() const </td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#25f2f0af883cd4580c8bd03a672896d8">nodes_of_sideB_begin</a>() const </td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#49c0b83a9306bab37acd84ac09618f2f">nodes_of_sideB_end</a>() const </td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#91d708f5221cd553761bc69e74576f42">operator[]</a>(const node &amp;n) const </td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#61c77e15f54e288a192d3710ed9a2fc4">reset</a>()</td><td><a class="el" href="a00012.html">fm_partition</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#015b171fcaa01973ebe6c6a46a727097">run</a>(graph &amp;G)</td><td><a class="el" href="a00012.html">fm_partition</a></td><td><code> [virtual]</code></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#a15471da2b6a0f14060b0c4091c6b05c">set_vars</a>(const graph &amp;G, const node_map&lt; int &gt; &amp;node_weight, const edge_map&lt; int &gt; &amp;edge_weight)</td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#f4d1b1275050cc7f4327500cec1f6e88">set_vars</a>(const graph &amp;G, const node_map&lt; int &gt; &amp;node_weight, const edge_map&lt; int &gt; &amp;edge_weight, const node_map&lt; side_type &gt; &amp;init_side)</td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#d0bebf48731e99fbf7a8c6526ab0f9a6">set_vars</a>(const graph &amp;G, const node_map&lt; int &gt; &amp;node_weight, const edge_map&lt; int &gt; &amp;edge_weight, const node_map&lt; fix_type &gt; &amp;fixed)</td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#19ade0d3e19eb40841238c1048c4495b">set_vars</a>(const graph &amp;G, const node_map&lt; int &gt; &amp;node_weight, const edge_map&lt; int &gt; &amp;edge_weight, const node_map&lt; side_type &gt; &amp;init_side, const node_map&lt; fix_type &gt; &amp;fixed)</td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#7cdff1bea3740a287387e8408e16ca79">side_type</a> typedef</td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#d0870674a1fb8e1c882f6855e32aec09">store_cut_edges</a>(const bool set)</td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#8926005b4637055d2acf6f29ad2d9b97">store_nodesAB</a>(const bool set)</td><td><a class="el" href="a00012.html">fm_partition</a></td><td></td></tr>
  <tr class="memlist"><td><a class="el" href="a00012.html#fa0678441747b1ac581f08fd55e27d4a">UNFIXED</a></td><td><a class="el" href="a00012.html">fm_partition</a></td><td><code> [static]</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="a00012.html#20d4a0c325a057d7a897076d0e237073">~fm_partition</a>()</td><td><a class="el" href="a00012.html">fm_partition</a></td><td><code> [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>