mooigraph
/
regraphlet


			
				
					
						
						
							1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087
							<!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: ratio_cut_partition 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>ratio_cut_partition Class Reference</h1><!-- doxytag: class="ratio_cut_partition" --><!-- doxytag: inherits="algorithm" -->Heuristic <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> bi-partitioning <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> (Wei-Cheng).  
<a href="#_details">More...</a>
<p>
<div class="dynheader">
Inheritance diagram for ratio_cut_partition:</div>
<div class="dynsection">
<p><center><img src="a00194.gif" border="0" usemap="#a00195" alt="Inheritance graph"></center>
<map name="a00195">
<area shape="rect" href="a00001.html" title="Abstract baseclass for all algoritm&#45;classes." alt="" coords="31,7,108,31"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
<div class="dynheader">
Collaboration diagram for ratio_cut_partition:</div>
<div class="dynsection">
<p><center><img src="a00196.gif" border="0" usemap="#a00197" alt="Collaboration graph"></center>
<map name="a00197">
<area shape="rect" href="a00001.html" title="Abstract baseclass for all algoritm&#45;classes." alt="" coords="625,5,703,29"><area shape="rect" href="a00020.html" title="A node in a graph." alt="" coords="639,92,689,116"><area shape="rect" title="source_node\ntarget_node" alt="" coords="687,100,695,108"><area shape="rect" title="source_node\ntarget_node" alt="" coords="983,165,991,173"><area shape="rect" title="int_node" alt="" coords="635,95,643,103"><area shape="rect" title="int_node" alt="" coords="687,93,695,101"><area shape="rect" href="a00021.html" title="node_map\&lt; int \&gt;" alt="" coords="603,145,725,169"><area shape="rect" title="gain_value\nnode_weight" alt="" coords="721,157,729,165"><area shape="rect" title="gain_value\nnode_weight" alt="" coords="936,172,944,180"><area shape="rect" href="a00019.html" title="ne_map\&lt; node, int, graph, allocator\&lt; int \&gt; \&gt;" alt="" coords="111,145,393,169"><area shape="rect" href="a00021.html" title="node_map\&lt; list\&lt; node \&gt;::iterator \&gt;" alt="" coords="551,193,777,217"><area shape="rect" title="position_in_bucket" alt="" coords="775,200,783,208"><area shape="rect" title="position_in_bucket" alt="" coords="936,189,944,197"><area shape="rect" href="a00019.html" title="ne_map\&lt; node, list\&lt; node \&gt;::iterator, graph, allocator\&lt; list\&lt; node \&gt;::iterator \&gt; \&gt;" alt="" coords="5,193,499,217"><area shape="rect" href="a00011.html" title="edge_map\&lt; int \&gt;" alt="" coords="603,267,725,291"><area shape="rect" title="aside\nbside\nedge_weight" alt="" coords="721,279,729,287"><area shape="rect" title="aside\nbside\nedge_weight" alt="" coords="988,191,996,199"><area shape="rect" href="a00019.html" title="ne_map\&lt; edge, int, graph, allocator\&lt; int \&gt; \&gt;" alt="" coords="111,267,393,291"><area shape="rect" href="a00011.html" title="edge_map\&lt; list\&lt; node \&gt; \&gt;" alt="" coords="575,327,753,351"><area shape="rect" title="unlockedA\nunlockedB" alt="" coords="749,345,757,353"><area shape="rect" title="unlockedA\nunlockedB" alt="" coords="996,191,1004,199"><area shape="rect" href="a00019.html" title="ne_map\&lt; edge, list\&lt; node \&gt;, graph, allocator\&lt; list\&lt; node \&gt; \&gt; \&gt;" alt="" coords="55,327,449,351"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>

<p>
<a href="a00198.html">List of all members.</a><table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td colspan="2"><br><h2>Public Types</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">side_type</a></td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef short int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#558dda40abda8ab03edb4605dbb81e36">fix_type</a></td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef list&lt; <a class="el" href="a00010.html">edge</a> &gt;<br>
::const_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#5269af60e49810067411b085a1341adc">cut_edges_iterator</a></td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef list&lt; <a class="el" href="a00020.html">node</a> &gt;<br>
::const_iterator&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#4f667099b56ded1bfef8f1fb4d09f81c">nodes_of_one_side_iterator</a></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="a00025.html#56e283d4ec5a06115146982e86c65878">ratio_cut_partition</a> ()</td></tr>

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

<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#4c143f82aac5fee3b955414ab7d6ce19">set_vars</a> (const <a class="el" href="a00014.html">graph</a> &amp;G, const <a class="el" href="a00021.html">node_map</a>&lt; int &gt; &amp;node_weight, const <a class="el" href="a00011.html">edge_map</a>&lt; int &gt; &amp;edge_weight)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#acd519cdb1760af792e22d57e746c07f">set_vars</a> (const <a class="el" href="a00014.html">graph</a> &amp;G, const <a class="el" href="a00021.html">node_map</a>&lt; int &gt; &amp;node_weight, const <a class="el" href="a00011.html">edge_map</a>&lt; int &gt; &amp;edge_weight, const <a class="el" href="a00020.html">node</a> source_node, const <a class="el" href="a00020.html">node</a> target_node)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#67ea2ccb8b5cce2e4acd8e10e112a962">set_vars</a> (const <a class="el" href="a00014.html">graph</a> &amp;G, const <a class="el" href="a00021.html">node_map</a>&lt; int &gt; &amp;node_weight, const <a class="el" href="a00011.html">edge_map</a>&lt; int &gt; &amp;edge_weight, const <a class="el" href="a00020.html">node</a> source_node, const <a class="el" href="a00020.html">node</a> target_node, const <a class="el" href="a00021.html">node_map</a>&lt; <a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">side_type</a> &gt; &amp;init_side)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#2c09504b727a1b1d1e2f99a3a42de05b">set_vars</a> (const <a class="el" href="a00014.html">graph</a> &amp;G, const <a class="el" href="a00021.html">node_map</a>&lt; int &gt; &amp;node_weight, const <a class="el" href="a00011.html">edge_map</a>&lt; int &gt; &amp;edge_weight, const <a class="el" href="a00020.html">node</a> source_node, const <a class="el" href="a00020.html">node</a> target_node, const <a class="el" href="a00021.html">node_map</a>&lt; <a class="el" href="a00025.html#558dda40abda8ab03edb4605dbb81e36">fix_type</a> &gt; &amp;fixed)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#0ed59d80c7e15d2865d6aa4657ae3f78">set_vars</a> (const <a class="el" href="a00014.html">graph</a> &amp;G, const <a class="el" href="a00021.html">node_map</a>&lt; int &gt; &amp;node_weight, const <a class="el" href="a00011.html">edge_map</a>&lt; int &gt; &amp;edge_weight, const <a class="el" href="a00020.html">node</a> source_node, const <a class="el" href="a00020.html">node</a> target_node, const <a class="el" href="a00021.html">node_map</a>&lt; <a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">side_type</a> &gt; &amp;init_side, const <a class="el" href="a00021.html">node_map</a>&lt; <a class="el" href="a00025.html#558dda40abda8ab03edb4605dbb81e36">fix_type</a> &gt; &amp;fixed)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#f5a76fa0ecaf2c75792cc2c1574994c7">store_cut_edges</a> (const bool set)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">void&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#f0efdeab02cb235df47e2339c196051f">store_nodesAB</a> (const bool set)</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#c4bdc17520a51ffda1a51294ed8e83ef">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="a00025.html#4ab180ca4cf57c811e3478c3de4c4dc3">run</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="a00025.html#4fc9beab107546850974ffd5a47c1e7f">get_cutsize</a> ()</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">double&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#9a61b2be36953d57e36fbb511cf1aa96">get_cutratio</a> ()</td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">side_type</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#58297f476305db83785ab0dfaee02a75">get_side_of_node</a> (const <a class="el" href="a00020.html">node</a> &amp;n) const </td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">side_type</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#c92bcfeda33420b0f4c1bf873b04644b">operator[]</a> (const <a class="el" href="a00020.html">node</a> &amp;n) const </td></tr>

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

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

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00025.html#5269af60e49810067411b085a1341adc">cut_edges_iterator</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#254e3c1f15855db67557f80f2513a378">cut_edges_begin</a> () const </td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00025.html#5269af60e49810067411b085a1341adc">cut_edges_iterator</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#7bcefed3f3e1dc93e4d8bf259134a43b">cut_edges_end</a> () const </td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00025.html#4f667099b56ded1bfef8f1fb4d09f81c">nodes_of_one_side_iterator</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#9292652c9b0a2f806dcff77c03396d85">nodes_of_sideA_begin</a> () const </td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00025.html#4f667099b56ded1bfef8f1fb4d09f81c">nodes_of_one_side_iterator</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#f7464a3a4f6ed4beeeff9d834fa102ef">nodes_of_sideA_end</a> () const </td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00025.html#4f667099b56ded1bfef8f1fb4d09f81c">nodes_of_one_side_iterator</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#cfa58a6af383c1afb17fa1c7d0389cfe">nodes_of_sideB_begin</a> () const </td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00025.html#4f667099b56ded1bfef8f1fb4d09f81c">nodes_of_one_side_iterator</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#7a4f67c08c143eab4d1b0c89fdddde9d">nodes_of_sideB_end</a> () 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="a00025.html#941fa7af07b89ba98454bbf31140061b">reset</a> ()</td></tr>

<tr><td colspan="2"><br><h2>Static Public Attributes</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static const <a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">side_type</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#81bfe2382ea876b98112143593612cb4">A</a></td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">static const <a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">side_type</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#df8f7eaaf11ff5461f3f4404010a05cb">B</a></td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">static const <a class="el" href="a00025.html#558dda40abda8ab03edb4605dbb81e36">fix_type</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#c964b04d22ceb3ea2d49780df72032f3">FIXA</a></td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">static const <a class="el" href="a00025.html#558dda40abda8ab03edb4605dbb81e36">fix_type</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#31884bac5dce93e880836925a2cc71c9">FIXB</a></td></tr>

<tr><td class="memItemLeft" nowrap align="right" valign="top">static const <a class="el" href="a00025.html#558dda40abda8ab03edb4605dbb81e36">fix_type</a>&nbsp;</td><td class="memItemRight" valign="bottom"><a class="el" href="a00025.html#2a1522e3dc701ac6af359614a111a1df">UNFIXED</a></td></tr>

</table>
<hr><a name="_details"></a><h2>Detailed Description</h2>
Heuristic <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> bi-partitioning <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> (Wei-Cheng). 
<p>
This class implements a heuristic <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> bi-partitioning <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> using the ratio cut method proposed by Y. C. Wei and C. K. Cheng in 1991.<p>
In the case 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 <code>O(|E|)</code> time to proceed.<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00012.html" title="Heuristic graph bi-partitioning algorithm (Fiduccia-Mattheyses).">fm_partition</a> </dd></dl>
<hr><h2>Member Typedef Documentation</h2>
<a class="anchor" name="ce53442bd0c1e21fbf00858ec6f6b456"></a><!-- doxytag: member="ratio_cut_partition::side_type" ref="ce53442bd0c1e21fbf00858ec6f6b456" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef int <a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">ratio_cut_partition::side_type</a>          </td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Return type of <a class="el" href="a00025.html#58297f476305db83785ab0dfaee02a75">ratio_cut_partition::get_side_of_node</a>.<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00025.html#81bfe2382ea876b98112143593612cb4">ratio_cut_partition::A</a> <p>
<a class="el" href="a00025.html#df8f7eaaf11ff5461f3f4404010a05cb">ratio_cut_partition::B</a> </dd></dl>

</div>
</div><p>
<a class="anchor" name="558dda40abda8ab03edb4605dbb81e36"></a><!-- doxytag: member="ratio_cut_partition::fix_type" ref="558dda40abda8ab03edb4605dbb81e36" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef short int <a class="el" href="a00025.html#558dda40abda8ab03edb4605dbb81e36">ratio_cut_partition::fix_type</a>          </td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Fix type of each <a class="el" href="a00020.html" title="A node in a graph.">node</a> (needed with <a class="el" href="a00025.html#4c143f82aac5fee3b955414ab7d6ce19">ratio_cut_partition::set_vars</a>).<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00025.html#c964b04d22ceb3ea2d49780df72032f3">ratio_cut_partition::FIXA</a> <p>
<a class="el" href="a00025.html#31884bac5dce93e880836925a2cc71c9">ratio_cut_partition::FIXB</a> <p>
<a class="el" href="a00025.html#2a1522e3dc701ac6af359614a111a1df">ratio_cut_partition::UNFIXED</a> </dd></dl>

</div>
</div><p>
<a class="anchor" name="5269af60e49810067411b085a1341adc"></a><!-- doxytag: member="ratio_cut_partition::cut_edges_iterator" ref="5269af60e49810067411b085a1341adc" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef list&lt;<a class="el" href="a00010.html">edge</a>&gt;::const_iterator <a class="el" href="a00025.html#5269af60e49810067411b085a1341adc">ratio_cut_partition::cut_edges_iterator</a>          </td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Iterator type for edges which belong to the cut. 
</div>
</div><p>
<a class="anchor" name="4f667099b56ded1bfef8f1fb4d09f81c"></a><!-- doxytag: member="ratio_cut_partition::nodes_of_one_side_iterator" ref="4f667099b56ded1bfef8f1fb4d09f81c" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">typedef list&lt;<a class="el" href="a00020.html">node</a>&gt;::const_iterator <a class="el" href="a00025.html#4f667099b56ded1bfef8f1fb4d09f81c">ratio_cut_partition::nodes_of_one_side_iterator</a>          </td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Iterator type for nodes of a side. 
</div>
</div><p>
<hr><h2>Constructor &amp; Destructor Documentation</h2>
<a class="anchor" name="56e283d4ec5a06115146982e86c65878"></a><!-- doxytag: member="ratio_cut_partition::ratio_cut_partition" ref="56e283d4ec5a06115146982e86c65878" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">ratio_cut_partition::ratio_cut_partition           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Default constructor.<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="b61c1b108ba230abd0a921b095b5abdc"></a><!-- doxytag: member="ratio_cut_partition::~ratio_cut_partition" ref="b61c1b108ba230abd0a921b095b5abdc" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">virtual ratio_cut_partition::~ratio_cut_partition           </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="4c143f82aac5fee3b955414ab7d6ce19"></a><!-- doxytag: member="ratio_cut_partition::set_vars" ref="4c143f82aac5fee3b955414ab7d6ce19" args="(const graph &amp;G, const node_map&lt; int &gt; &amp;node_weight, const edge_map&lt; int &gt; &amp;edge_weight)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void ratio_cut_partition::set_vars           </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>G</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00021.html">node_map</a>&lt; int &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>node_weight</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00011.html">edge_map</a>&lt; int &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>edge_weight</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 variables. Must be executed before <a class="el" href="a00025.html#c4bdc17520a51ffda1a51294ed8e83ef">ratio_cut_partition::check</a>! <code>source_node</code> and <code>target_node</code> will be determined 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>G</em>&nbsp;</td><td>undirected <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>node_weight</em>&nbsp;</td><td>weight of each <a class="el" href="a00020.html" title="A node in a graph.">node</a> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>edge_weight</em>&nbsp;</td><td>weight of each <a class="el" href="a00010.html" title="An edge in a graph.">edge</a>. </td></tr>
  </table>
</dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00025.html#c4bdc17520a51ffda1a51294ed8e83ef">ratio_cut_partition::check</a> </dd></dl>

</div>
</div><p>
<a class="anchor" name="acd519cdb1760af792e22d57e746c07f"></a><!-- doxytag: member="ratio_cut_partition::set_vars" ref="acd519cdb1760af792e22d57e746c07f" args="(const graph &amp;G, const node_map&lt; int &gt; &amp;node_weight, const edge_map&lt; int &gt; &amp;edge_weight, const node source_node, const node target_node)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void ratio_cut_partition::set_vars           </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>G</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00021.html">node_map</a>&lt; int &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>node_weight</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00011.html">edge_map</a>&lt; int &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>edge_weight</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00020.html">node</a>&nbsp;</td>
          <td class="paramname"> <em>source_node</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00020.html">node</a>&nbsp;</td>
          <td class="paramname"> <em>target_node</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 variables. Must be executed before <a class="el" href="a00025.html#c4bdc17520a51ffda1a51294ed8e83ef">ratio_cut_partition::check</a>! In order to get good results, you should take two <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> theoretically far away nodes as source and target.<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>undirected <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>node_weight</em>&nbsp;</td><td>weight of each <a class="el" href="a00020.html" title="A node in a graph.">node</a> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>edge_weight</em>&nbsp;</td><td>weight of each <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>source_node</em>&nbsp;</td><td>start-node, remains on side <code>A</code> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>target_node</em>&nbsp;</td><td>end-node, remains on side <code>B</code> </td></tr>
  </table>
</dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00025.html#c4bdc17520a51ffda1a51294ed8e83ef">ratio_cut_partition::check</a> </dd></dl>

</div>
</div><p>
<a class="anchor" name="67ea2ccb8b5cce2e4acd8e10e112a962"></a><!-- doxytag: member="ratio_cut_partition::set_vars" ref="67ea2ccb8b5cce2e4acd8e10e112a962" args="(const graph &amp;G, const node_map&lt; int &gt; &amp;node_weight, const edge_map&lt; int &gt; &amp;edge_weight, const node source_node, const node target_node, const node_map&lt; side_type &gt; &amp;init_side)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void ratio_cut_partition::set_vars           </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>G</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00021.html">node_map</a>&lt; int &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>node_weight</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00011.html">edge_map</a>&lt; int &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>edge_weight</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00020.html">node</a>&nbsp;</td>
          <td class="paramname"> <em>source_node</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00020.html">node</a>&nbsp;</td>
          <td class="paramname"> <em>target_node</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00021.html">node_map</a>&lt; <a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">side_type</a> &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>init_side</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 variables. Must be executed before <a class="el" href="a00025.html#c4bdc17520a51ffda1a51294ed8e83ef">ratio_cut_partition::check</a>! In order to get good results, you should take two <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> theoretically far away nodes as source and target. Additionally <code>init_side</code> should nearly be in balance. <code>source_node</code> must be on side <code>A</code> in <code> init_side</code> and <code>target_node</code> on side <code>B </code> respectively.<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>undirected <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>node_weight</em>&nbsp;</td><td>weight of each <a class="el" href="a00020.html" title="A node in a graph.">node</a> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>edge_weight</em>&nbsp;</td><td>weight of each <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>source_node</em>&nbsp;</td><td>start-node, remains on side <code>A</code> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>target_node</em>&nbsp;</td><td>end-node, remains on side <code>B</code> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>init_side</em>&nbsp;</td><td>initial bi-partitioning </td></tr>
  </table>
</dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00025.html#c4bdc17520a51ffda1a51294ed8e83ef">ratio_cut_partition::check</a> </dd></dl>

</div>
</div><p>
<a class="anchor" name="2c09504b727a1b1d1e2f99a3a42de05b"></a><!-- doxytag: member="ratio_cut_partition::set_vars" ref="2c09504b727a1b1d1e2f99a3a42de05b" args="(const graph &amp;G, const node_map&lt; int &gt; &amp;node_weight, const edge_map&lt; int &gt; &amp;edge_weight, const node source_node, const node target_node, const node_map&lt; fix_type &gt; &amp;fixed)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void ratio_cut_partition::set_vars           </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>G</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00021.html">node_map</a>&lt; int &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>node_weight</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00011.html">edge_map</a>&lt; int &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>edge_weight</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00020.html">node</a>&nbsp;</td>
          <td class="paramname"> <em>source_node</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00020.html">node</a>&nbsp;</td>
          <td class="paramname"> <em>target_node</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00021.html">node_map</a>&lt; <a class="el" href="a00025.html#558dda40abda8ab03edb4605dbb81e36">fix_type</a> &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>fixed</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 variables. Must be executed before <a class="el" href="a00025.html#c4bdc17520a51ffda1a51294ed8e83ef">ratio_cut_partition::check</a>! In order to get good results, you should take two <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> theoretically far away nodes as source and target. <code>source_node</code> must not be fixed on side <code>B </code>. <code>target_node</code> must not be fixed on side <code>A </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>undirected <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>node_weight</em>&nbsp;</td><td>weight of each <a class="el" href="a00020.html" title="A node in a graph.">node</a> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>edge_weight</em>&nbsp;</td><td>weight of each <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>source_node</em>&nbsp;</td><td>start-node, remains on side <code>A</code> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>target_node</em>&nbsp;</td><td>end-node, remains on side <code>B</code> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>fixed</em>&nbsp;</td><td>fixed nodes </td></tr>
  </table>
</dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00025.html#c4bdc17520a51ffda1a51294ed8e83ef">ratio_cut_partition::check</a> </dd></dl>

</div>
</div><p>
<a class="anchor" name="0ed59d80c7e15d2865d6aa4657ae3f78"></a><!-- doxytag: member="ratio_cut_partition::set_vars" ref="0ed59d80c7e15d2865d6aa4657ae3f78" args="(const graph &amp;G, const node_map&lt; int &gt; &amp;node_weight, const edge_map&lt; int &gt; &amp;edge_weight, const node source_node, const node target_node, const node_map&lt; side_type &gt; &amp;init_side, const node_map&lt; fix_type &gt; &amp;fixed)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void ratio_cut_partition::set_vars           </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="a00014.html">graph</a> &amp;&nbsp;</td>
          <td class="paramname"> <em>G</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00021.html">node_map</a>&lt; int &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>node_weight</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00011.html">edge_map</a>&lt; int &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>edge_weight</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00020.html">node</a>&nbsp;</td>
          <td class="paramname"> <em>source_node</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00020.html">node</a>&nbsp;</td>
          <td class="paramname"> <em>target_node</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00021.html">node_map</a>&lt; <a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">side_type</a> &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>init_side</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="a00021.html">node_map</a>&lt; <a class="el" href="a00025.html#558dda40abda8ab03edb4605dbb81e36">fix_type</a> &gt; &amp;&nbsp;</td>
          <td class="paramname"> <em>fixed</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 variables. Must be executed before <a class="el" href="a00025.html#c4bdc17520a51ffda1a51294ed8e83ef">ratio_cut_partition::check</a>! In order to get good results, you should take two <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> theoretically far away nodes as source and target. Additionally <code>init_side</code> should nearly be in balance. Fixed nodes are on their fix side, their initial side is overwritten then. <code>source_node</code> must be on side A in <code>init_side </code> and <code>target_node</code> on side B respectively. <code>source_node</code> must not be fixed on side <code>B </code>. <code>target_node</code> must not be fixed on side <code>A </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>undirected <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>node_weight</em>&nbsp;</td><td>weight of each <a class="el" href="a00020.html" title="A node in a graph.">node</a> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>edge_weight</em>&nbsp;</td><td>weight of each <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>source_node</em>&nbsp;</td><td>start-node, remains on side <code>A</code> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>target_node</em>&nbsp;</td><td>end-node, remains on side <code>B</code> </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>init_side</em>&nbsp;</td><td>initial bi-partitioning </td></tr>
    <tr><td valign="top"></td><td valign="top"><em>fixed</em>&nbsp;</td><td>fixed nodes </td></tr>
  </table>
</dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00025.html#c4bdc17520a51ffda1a51294ed8e83ef">ratio_cut_partition::check</a> </dd></dl>

</div>
</div><p>
<a class="anchor" name="f5a76fa0ecaf2c75792cc2c1574994c7"></a><!-- doxytag: member="ratio_cut_partition::store_cut_edges" ref="f5a76fa0ecaf2c75792cc2c1574994c7" args="(const bool set)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void ratio_cut_partition::store_cut_edges           </td>
          <td>(</td>
          <td class="paramtype">const bool&nbsp;</td>
          <td class="paramname"> <em>set</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Enables the storing of cut-edges. If enabled the list of cut-edges can be traversed using <a class="el" href="a00025.html#5269af60e49810067411b085a1341adc">ratio_cut_partition::cut_edges_iterator</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>set</em>&nbsp;</td><td>if <code>true</code> cut_edges will be stored </td></tr>
  </table>
</dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00025.html#254e3c1f15855db67557f80f2513a378">ratio_cut_partition::cut_edges_begin</a> <p>
<a class="el" href="a00025.html#7bcefed3f3e1dc93e4d8bf259134a43b">ratio_cut_partition::cut_edges_end</a> </dd></dl>

</div>
</div><p>
<a class="anchor" name="f0efdeab02cb235df47e2339c196051f"></a><!-- doxytag: member="ratio_cut_partition::store_nodesAB" ref="f0efdeab02cb235df47e2339c196051f" args="(const bool set)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void ratio_cut_partition::store_nodesAB           </td>
          <td>(</td>
          <td class="paramtype">const bool&nbsp;</td>
          <td class="paramname"> <em>set</em>          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Enables the storing of nodes on their side. If enabled the nodes of each side can be traversed using <a class="el" href="a00025.html#4f667099b56ded1bfef8f1fb4d09f81c">ratio_cut_partition::nodes_of_one_side_iterator</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>set</em>&nbsp;</td><td>if <code>true</code> nodes on their side will be stored </td></tr>
  </table>
</dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00025.html#9292652c9b0a2f806dcff77c03396d85">ratio_cut_partition::nodes_of_sideA_begin</a> <p>
<a class="el" href="a00025.html#f7464a3a4f6ed4beeeff9d834fa102ef">ratio_cut_partition::nodes_of_sideA_end</a> <p>
<a class="el" href="a00025.html#cfa58a6af383c1afb17fa1c7d0389cfe">ratio_cut_partition::nodes_of_sideB_begin</a> <p>
<a class="el" href="a00025.html#7a4f67c08c143eab4d1b0c89fdddde9d">ratio_cut_partition::nodes_of_sideB_end</a> </dd></dl>

</div>
</div><p>
<a class="anchor" name="c4bdc17520a51ffda1a51294ed8e83ef"></a><!-- doxytag: member="ratio_cut_partition::check" ref="c4bdc17520a51ffda1a51294ed8e83ef" args="(graph &amp;G)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">virtual int ratio_cut_partition::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>
One of the <a class="el" href="a00025.html#4c143f82aac5fee3b955414ab7d6ce19">ratio_cut_partition::set_vars</a> procedures has been executed before. </li>
<li>
<a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> <code>G</code> is undirected. </li>
<li>
if applied, <code>source_node</code> and <code>target_node </code> are 2 distinct nodes with <a class="el" href="a00020.html" title="A node in a graph.">node</a> weights &gt; 0. </li>
<li>
only node_weights &gt;= 0 are applied. </li>
<li>
only edge_weights &gt;= 0 are applied. </li>
<li>
if <code>G</code> has more than 2 nodes, then at least two of them have a weight &gt; 0. </li>
<li>
if applied fixed source <a class="el" href="a00020.html" title="A node in a graph.">node</a>, <code>fixed[source_node] </code> is <code>FIXA</code>. </li>
<li>
if applied fixed target <a class="el" href="a00020.html" title="A node in a graph.">node</a>, <code>fixed[target_node] </code> is <code>FIXB</code>. </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="a00025.html#4c143f82aac5fee3b955414ab7d6ce19">ratio_cut_partition::set_vars</a> <p>
<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="4ab180ca4cf57c811e3478c3de4c4dc3"></a><!-- doxytag: member="ratio_cut_partition::run" ref="4ab180ca4cf57c811e3478c3de4c4dc3" args="(graph &amp;G)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int ratio_cut_partition::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 a partitioning of <code>G</code>, that means a division of its vertices in two sides <code><a class="el" href="a00025.html#81bfe2382ea876b98112143593612cb4">ratio_cut_partition::A</a></code> and <code><a class="el" href="a00025.html#df8f7eaaf11ff5461f3f4404010a05cb">ratio_cut_partition::B</a></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="4fc9beab107546850974ffd5a47c1e7f"></a><!-- doxytag: member="ratio_cut_partition::get_cutsize" ref="4fc9beab107546850974ffd5a47c1e7f" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int ratio_cut_partition::get_cutsize           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Gets the size of the cut after bi-partitioning.<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>cutsize </dd></dl>

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

<p>
Gets the ratio of the cut after bi-partitioning as defined in [WeiChe91].<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>cutratio </dd></dl>

</div>
</div><p>
<a class="anchor" name="58297f476305db83785ab0dfaee02a75"></a><!-- doxytag: member="ratio_cut_partition::get_side_of_node" ref="58297f476305db83785ab0dfaee02a75" args="(const node &amp;n) const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">side_type</a> ratio_cut_partition::get_side_of_node           </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%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Gets side of the <a class="el" href="a00020.html" title="A node in a graph.">node</a> after bi-partitioning.<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> of <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> G </td></tr>
  </table>
</dl>
<dl class="return" compact><dt><b>Returns:</b></dt><dd><code><a class="el" href="a00025.html#81bfe2382ea876b98112143593612cb4">ratio_cut_partition::A</a></code> if <code>n</code> lies on side <code>A</code>, <code><a class="el" href="a00025.html#df8f7eaaf11ff5461f3f4404010a05cb">ratio_cut_partition::B</a></code> otherwise </dd></dl>

</div>
</div><p>
<a class="anchor" name="c92bcfeda33420b0f4c1bf873b04644b"></a><!-- doxytag: member="ratio_cut_partition::operator[]" ref="c92bcfeda33420b0f4c1bf873b04644b" args="(const node &amp;n) const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">side_type</a> ratio_cut_partition::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%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Gets side of the <a class="el" href="a00020.html" title="A node in a graph.">node</a> after bi-partitioning.<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> of <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> G </td></tr>
  </table>
</dl>
<dl class="return" compact><dt><b>Returns:</b></dt><dd><code><a class="el" href="a00025.html#81bfe2382ea876b98112143593612cb4">ratio_cut_partition::A</a></code> if <code>n</code> lies on side <code>A</code>, <code><a class="el" href="a00025.html#df8f7eaaf11ff5461f3f4404010a05cb">ratio_cut_partition::B</a></code> otherwise </dd></dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00025.html#58297f476305db83785ab0dfaee02a75">ratio_cut_partition::get_side_of_node</a> </dd></dl>

</div>
</div><p>
<a class="anchor" name="c8acd8f7dd03f9034b300ded4b7433c2"></a><!-- doxytag: member="ratio_cut_partition::get_weight_on_sideA" ref="c8acd8f7dd03f9034b300ded4b7433c2" args="(const graph &amp;G) const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int ratio_cut_partition::get_weight_on_sideA           </td>
          <td>(</td>
          <td class="paramtype">const <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%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Gets the sum of all <a class="el" href="a00020.html" title="A node in a graph.">node</a> weights from nodes on side <code>A </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>node_weight_on_sideA</code> </dd></dl>

</div>
</div><p>
<a class="anchor" name="540d6e5fdf509a65d06f0704b029719a"></a><!-- doxytag: member="ratio_cut_partition::get_weight_on_sideB" ref="540d6e5fdf509a65d06f0704b029719a" args="(const graph &amp;G) const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int ratio_cut_partition::get_weight_on_sideB           </td>
          <td>(</td>
          <td class="paramtype">const <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%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Gets the sum of all <a class="el" href="a00020.html" title="A node in a graph.">node</a> weights from nodes on side <code>B </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>node_weight_on_sideB</code> </dd></dl>

</div>
</div><p>
<a class="anchor" name="254e3c1f15855db67557f80f2513a378"></a><!-- doxytag: member="ratio_cut_partition::cut_edges_begin" ref="254e3c1f15855db67557f80f2513a378" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00025.html#5269af60e49810067411b085a1341adc">cut_edges_iterator</a> ratio_cut_partition::cut_edges_begin           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Iterate through all edges which belong to the cut, that means all edges with end-nodes on different sides. It is only valid if enabled with <a class="el" href="a00025.html#f5a76fa0ecaf2c75792cc2c1574994c7">ratio_cut_partition::store_cut_edges</a> before.<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>start for iteration through all cut edges </dd></dl>

</div>
</div><p>
<a class="anchor" name="7bcefed3f3e1dc93e4d8bf259134a43b"></a><!-- doxytag: member="ratio_cut_partition::cut_edges_end" ref="7bcefed3f3e1dc93e4d8bf259134a43b" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00025.html#5269af60e49810067411b085a1341adc">cut_edges_iterator</a> ratio_cut_partition::cut_edges_end           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
End-Iterator for iteration through all edges which belong to the cut. It is only valid if enabled with <a class="el" href="a00025.html#f5a76fa0ecaf2c75792cc2c1574994c7">ratio_cut_partition::store_cut_edges</a> before.<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>end for iteration through all cut-edges </dd></dl>

</div>
</div><p>
<a class="anchor" name="9292652c9b0a2f806dcff77c03396d85"></a><!-- doxytag: member="ratio_cut_partition::nodes_of_sideA_begin" ref="9292652c9b0a2f806dcff77c03396d85" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00025.html#4f667099b56ded1bfef8f1fb4d09f81c">nodes_of_one_side_iterator</a> ratio_cut_partition::nodes_of_sideA_begin           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Iterate through all nodes which belong to side <code>A</code>, It is only valid if enabled with <a class="el" href="a00025.html#f0efdeab02cb235df47e2339c196051f">ratio_cut_partition::store_nodesAB</a> before.<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>start for iteration through all nodes on <code>A</code> </dd></dl>

</div>
</div><p>
<a class="anchor" name="f7464a3a4f6ed4beeeff9d834fa102ef"></a><!-- doxytag: member="ratio_cut_partition::nodes_of_sideA_end" ref="f7464a3a4f6ed4beeeff9d834fa102ef" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00025.html#4f667099b56ded1bfef8f1fb4d09f81c">nodes_of_one_side_iterator</a> ratio_cut_partition::nodes_of_sideA_end           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
End-Iterator for iteration through all nodes which belong to side <code>A</code>, It is only valid if enabled with <a class="el" href="a00025.html#f0efdeab02cb235df47e2339c196051f">ratio_cut_partition::store_nodesAB</a> before.<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>end for iteration through all nodes on <code>A</code> </dd></dl>

</div>
</div><p>
<a class="anchor" name="cfa58a6af383c1afb17fa1c7d0389cfe"></a><!-- doxytag: member="ratio_cut_partition::nodes_of_sideB_begin" ref="cfa58a6af383c1afb17fa1c7d0389cfe" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00025.html#4f667099b56ded1bfef8f1fb4d09f81c">nodes_of_one_side_iterator</a> ratio_cut_partition::nodes_of_sideB_begin           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
Iterate through all nodes which belong to side <code>B</code>, It is only valid if enabled with <a class="el" href="a00025.html#f0efdeab02cb235df47e2339c196051f">ratio_cut_partition::store_nodesAB</a> before.<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>start for iteration through all nodes on <code>B</code> </dd></dl>

</div>
</div><p>
<a class="anchor" name="7a4f67c08c143eab4d1b0c89fdddde9d"></a><!-- doxytag: member="ratio_cut_partition::nodes_of_sideB_end" ref="7a4f67c08c143eab4d1b0c89fdddde9d" args="() const " -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="a00025.html#4f667099b56ded1bfef8f1fb4d09f81c">nodes_of_one_side_iterator</a> ratio_cut_partition::nodes_of_sideB_end           </td>
          <td>(</td>
          <td class="paramname">          </td>
          <td>&nbsp;)&nbsp;</td>
          <td width="100%"> const</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
End-Iterator for iteration through all nodes which belong to side <code>B</code>, It is only valid if enabled with <a class="el" href="a00025.html#f0efdeab02cb235df47e2339c196051f">ratio_cut_partition::store_nodesAB</a> before.<p>
<dl class="return" compact><dt><b>Returns:</b></dt><dd>end for iteration through all nodes on <code>B</code> </dd></dl>

</div>
</div><p>
<a class="anchor" name="941fa7af07b89ba98454bbf31140061b"></a><!-- doxytag: member="ratio_cut_partition::reset" ref="941fa7af07b89ba98454bbf31140061b" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">virtual void ratio_cut_partition::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 <a class="el" href="a00025.html" title="Heuristic graph bi-partitioning algorithm (Wei-Cheng).">ratio_cut_partition</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>
<hr><h2>Member Data Documentation</h2>
<a class="anchor" name="81bfe2382ea876b98112143593612cb4"></a><!-- doxytag: member="ratio_cut_partition::A" ref="81bfe2382ea876b98112143593612cb4" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">const <a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">side_type</a> <a class="el" href="a00025.html#81bfe2382ea876b98112143593612cb4">ratio_cut_partition::A</a><code> [static]</code>          </td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
<code>A</code> means the <a class="el" href="a00020.html" title="A node in a graph.">node</a> is on side A.<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">ratio_cut_partition::side_type</a> </dd></dl>

</div>
</div><p>
<a class="anchor" name="df8f7eaaf11ff5461f3f4404010a05cb"></a><!-- doxytag: member="ratio_cut_partition::B" ref="df8f7eaaf11ff5461f3f4404010a05cb" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">const <a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">side_type</a> <a class="el" href="a00025.html#df8f7eaaf11ff5461f3f4404010a05cb">ratio_cut_partition::B</a><code> [static]</code>          </td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
<code>B</code> means the <a class="el" href="a00020.html" title="A node in a graph.">node</a> is on side B.<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">ratio_cut_partition::side_type</a> </dd></dl>

</div>
</div><p>
<a class="anchor" name="c964b04d22ceb3ea2d49780df72032f3"></a><!-- doxytag: member="ratio_cut_partition::FIXA" ref="c964b04d22ceb3ea2d49780df72032f3" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">const <a class="el" href="a00025.html#558dda40abda8ab03edb4605dbb81e36">fix_type</a> <a class="el" href="a00025.html#c964b04d22ceb3ea2d49780df72032f3">ratio_cut_partition::FIXA</a><code> [static]</code>          </td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
<code>FIXA</code> means fix <a class="el" href="a00020.html" title="A node in a graph.">node</a> on side <code>A</code>.<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00025.html#4c143f82aac5fee3b955414ab7d6ce19">ratio_cut_partition::set_vars</a> </dd></dl>

</div>
</div><p>
<a class="anchor" name="31884bac5dce93e880836925a2cc71c9"></a><!-- doxytag: member="ratio_cut_partition::FIXB" ref="31884bac5dce93e880836925a2cc71c9" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">const <a class="el" href="a00025.html#558dda40abda8ab03edb4605dbb81e36">fix_type</a> <a class="el" href="a00025.html#31884bac5dce93e880836925a2cc71c9">ratio_cut_partition::FIXB</a><code> [static]</code>          </td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
<code>FIXB</code> means fix <a class="el" href="a00020.html" title="A node in a graph.">node</a> on side <code>B</code>.<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd>ratio_cut_partition::fixe_type </dd></dl>

</div>
</div><p>
<a class="anchor" name="2a1522e3dc701ac6af359614a111a1df"></a><!-- doxytag: member="ratio_cut_partition::UNFIXED" ref="2a1522e3dc701ac6af359614a111a1df" args="" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">const <a class="el" href="a00025.html#558dda40abda8ab03edb4605dbb81e36">fix_type</a> <a class="el" href="a00025.html#2a1522e3dc701ac6af359614a111a1df">ratio_cut_partition::UNFIXED</a><code> [static]</code>          </td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>
<code>UNFIXED</code> means <a class="el" href="a00020.html" title="A node in a graph.">node</a> is free.<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd>ratio_cut_partition::fixe_type </dd></dl>

</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>