a00198.html 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687
  1. <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
  2. <html>
  3. <head>
  4. <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
  5. <title>GTL - Graph Template Library: Member List</title>
  6. <link href="doxygen.css" rel="stylesheet" type="text/css">
  7. </head>
  8. <body>
  9. <p class="links">
  10. <a href="../index.html">Home</a> |
  11. Documentation |
  12. <a href="../register.html">Download</a> |
  13. <a href="../platforms.html">Platforms</a> |
  14. <a href="../refer.html">Projects</a> |
  15. <a href="../lists.html">Mailing Lists</a> |
  16. <a href="../history.html">Version History</a>
  17. </p>
  18. <!-- Generated by Doxygen 1.5.3 -->
  19. <div class="tabs">
  20. <ul>
  21. <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
  22. <li class="current"><a href="classes.html"><span>Classes</span></a></li>
  23. <li><a href="files.html"><span>Files</span></a></li>
  24. <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  25. </ul>
  26. </div>
  27. <div class="tabs">
  28. <ul>
  29. <li><a href="classes.html"><span>Alphabetical&nbsp;List</span></a></li>
  30. <li><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
  31. <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
  32. <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
  33. </ul>
  34. </div>
  35. <h1>ratio_cut_partition Member List</h1>This is the complete list of members for <a class="el" href="a00025.html">ratio_cut_partition</a>, including all inherited members.<p><table>
  36. <tr class="memlist"><td><a class="el" href="a00025.html#81bfe2382ea876b98112143593612cb4">A</a></td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td><code> [static]</code></td></tr>
  37. <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>
  38. <tr class="memlist"><td><a class="el" href="a00025.html#df8f7eaaf11ff5461f3f4404010a05cb">B</a></td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td><code> [static]</code></td></tr>
  39. <tr class="memlist"><td><a class="el" href="a00025.html#c4bdc17520a51ffda1a51294ed8e83ef">check</a>(graph &amp;G)</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td><code> [virtual]</code></td></tr>
  40. <tr class="memlist"><td><a class="el" href="a00025.html#254e3c1f15855db67557f80f2513a378">cut_edges_begin</a>() const </td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  41. <tr class="memlist"><td><a class="el" href="a00025.html#7bcefed3f3e1dc93e4d8bf259134a43b">cut_edges_end</a>() const </td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  42. <tr class="memlist"><td><a class="el" href="a00025.html#5269af60e49810067411b085a1341adc">cut_edges_iterator</a> typedef</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  43. <tr class="memlist"><td><a class="el" href="a00025.html#558dda40abda8ab03edb4605dbb81e36">fix_type</a> typedef</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  44. <tr class="memlist"><td><a class="el" href="a00025.html#c964b04d22ceb3ea2d49780df72032f3">FIXA</a></td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td><code> [static]</code></td></tr>
  45. <tr class="memlist"><td><a class="el" href="a00025.html#31884bac5dce93e880836925a2cc71c9">FIXB</a></td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td><code> [static]</code></td></tr>
  46. <tr class="memlist"><td><a class="el" href="a00025.html#9a61b2be36953d57e36fbb511cf1aa96">get_cutratio</a>()</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  47. <tr class="memlist"><td><a class="el" href="a00025.html#4fc9beab107546850974ffd5a47c1e7f">get_cutsize</a>()</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  48. <tr class="memlist"><td><a class="el" href="a00025.html#58297f476305db83785ab0dfaee02a75">get_side_of_node</a>(const node &amp;n) const </td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  49. <tr class="memlist"><td><a class="el" href="a00025.html#c8acd8f7dd03f9034b300ded4b7433c2">get_weight_on_sideA</a>(const graph &amp;G) const </td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  50. <tr class="memlist"><td><a class="el" href="a00025.html#540d6e5fdf509a65d06f0704b029719a">get_weight_on_sideB</a>(const graph &amp;G) const </td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  51. <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>
  52. <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>
  53. <tr class="memlist"><td><a class="el" href="a00025.html#4f667099b56ded1bfef8f1fb4d09f81c">nodes_of_one_side_iterator</a> typedef</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  54. <tr class="memlist"><td><a class="el" href="a00025.html#9292652c9b0a2f806dcff77c03396d85">nodes_of_sideA_begin</a>() const </td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  55. <tr class="memlist"><td><a class="el" href="a00025.html#f7464a3a4f6ed4beeeff9d834fa102ef">nodes_of_sideA_end</a>() const </td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  56. <tr class="memlist"><td><a class="el" href="a00025.html#cfa58a6af383c1afb17fa1c7d0389cfe">nodes_of_sideB_begin</a>() const </td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  57. <tr class="memlist"><td><a class="el" href="a00025.html#7a4f67c08c143eab4d1b0c89fdddde9d">nodes_of_sideB_end</a>() const </td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  58. <tr class="memlist"><td><a class="el" href="a00025.html#c92bcfeda33420b0f4c1bf873b04644b">operator[]</a>(const node &amp;n) const </td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  59. <tr class="memlist"><td><a class="el" href="a00025.html#56e283d4ec5a06115146982e86c65878">ratio_cut_partition</a>()</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  60. <tr class="memlist"><td><a class="el" href="a00025.html#941fa7af07b89ba98454bbf31140061b">reset</a>()</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td><code> [virtual]</code></td></tr>
  61. <tr class="memlist"><td><a class="el" href="a00025.html#4ab180ca4cf57c811e3478c3de4c4dc3">run</a>(graph &amp;G)</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td><code> [virtual]</code></td></tr>
  62. <tr class="memlist"><td><a class="el" href="a00025.html#4c143f82aac5fee3b955414ab7d6ce19">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="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  63. <tr class="memlist"><td><a class="el" href="a00025.html#acd519cdb1760af792e22d57e746c07f">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 source_node, const node target_node)</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  64. <tr class="memlist"><td><a class="el" href="a00025.html#67ea2ccb8b5cce2e4acd8e10e112a962">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 source_node, const node target_node, const node_map&lt; side_type &gt; &amp;init_side)</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  65. <tr class="memlist"><td><a class="el" href="a00025.html#2c09504b727a1b1d1e2f99a3a42de05b">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 source_node, const node target_node, const node_map&lt; fix_type &gt; &amp;fixed)</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  66. <tr class="memlist"><td><a class="el" href="a00025.html#0ed59d80c7e15d2865d6aa4657ae3f78">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 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)</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  67. <tr class="memlist"><td><a class="el" href="a00025.html#ce53442bd0c1e21fbf00858ec6f6b456">side_type</a> typedef</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  68. <tr class="memlist"><td><a class="el" href="a00025.html#f5a76fa0ecaf2c75792cc2c1574994c7">store_cut_edges</a>(const bool set)</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  69. <tr class="memlist"><td><a class="el" href="a00025.html#f0efdeab02cb235df47e2339c196051f">store_nodesAB</a>(const bool set)</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td></td></tr>
  70. <tr class="memlist"><td><a class="el" href="a00025.html#2a1522e3dc701ac6af359614a111a1df">UNFIXED</a></td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td><code> [static]</code></td></tr>
  71. <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>
  72. <tr class="memlist"><td><a class="el" href="a00025.html#b61c1b108ba230abd0a921b095b5abdc">~ratio_cut_partition</a>()</td><td><a class="el" href="a00025.html">ratio_cut_partition</a></td><td><code> [virtual]</code></td></tr>
  73. </table> <p class="links">
  74. <a href="http://www.uni-passau.de/">University of Passau</a>
  75. &nbsp;-&nbsp;
  76. <a href="http://www.fmi.uni-passau.de/">FMI</a>
  77. &nbsp;-&nbsp;
  78. <a href="http://www.fmi.uni-passau.de/fmi/lehrstuehle/brandenburg/">Theoretical
  79. Computer Science</a>
  80. </p>
  81. <div class="copyright">
  82. Design &copy; 2002, 2003 <a href="mailto:raitner@fmi.uni-passau.de">Marcus Raitner</a>, University of Passau
  83. </div>
  84. </body>
  85. </html>