<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>mrpt::graphs::CGraphPartitioner Class Reference</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<div align="left"><a href="http://www.mrpt.org/">Main MRPT website</a> > <b>C++ reference</b> </div>
<div align="right">
<a href="index.html"><img border="0" src="mrpt_logo.png" alt="MRPT logo"></a>
</div>
<!-- Generated by Doxygen 1.7.5 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li class="current"><a href="annotated.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
<li>
<div id="MSearchBox" class="MSearchBoxInactive">
<div class="left">
<form id="FSearchBox" action="search.php" method="get">
<img id="MSearchSelect" src="search/mag.png" alt=""/>
<input type="text" id="MSearchField" name="query" value="Search" size="20" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"/>
</form>
</div><div class="right"></div>
</div>
</li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="annotated.html"><span>Class List</span></a></li>
<li><a href="classes.html"><span>Class Index</span></a></li>
<li><a href="inherits.html"><span>Class Hierarchy</span></a></li>
<li><a href="functions.html"><span>Class Members</span></a></li>
</ul>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="namespacemrpt.html">mrpt</a> </li>
<li class="navelem"><a class="el" href="namespacemrpt_1_1graphs.html">graphs</a> </li>
<li class="navelem"><a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html">CGraphPartitioner</a> </li>
</ul>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#pub-static-methods">Static Public Member Functions</a> |
<a href="#pub-static-attribs">Static Public Attributes</a> |
<a href="#pri-static-attribs">Static Private Attributes</a> </div>
<div class="headertitle">
<div class="title">mrpt::graphs::CGraphPartitioner Class Reference</div> </div>
</div>
<div class="contents">
<!-- doxytag: class="mrpt::graphs::CGraphPartitioner" --><!-- doxytag: inherits="mrpt::utils::CDebugOutputCapable" --><hr/><a name="details" id="details"></a><h2>Detailed Description</h2>
<div class="textblock"><p>Algorithms for finding the min-normalized-cut of a weighted undirected graph. </p>
<p>Two static methods are provided, one for bisection and the other for iterative N-parts partition. It is based on the Shi-Malik method, proposed for example in:<br/>
<br/>
<code>J. Shi and J. Malik, "Normalized Cuts and Image Segmentation,"IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.22, no.8, pp. 888-905, Aug. 2000.</code><br/>
</p>
</div>
<p><code>#include <<a class="el" href="_c_graph_partitioner_8h_source.html">mrpt/graphs/CGraphPartitioner.h</a>></code></p>
<div class="dynheader">
Inheritance diagram for mrpt::graphs::CGraphPartitioner:</div>
<div class="dyncontent">
<div class="center"><img src="classmrpt_1_1graphs_1_1_c_graph_partitioner__inherit__graph.png" border="0" usemap="#mrpt_1_1graphs_1_1_c_graph_partitioner_inherit__map" alt="Inheritance graph"/></div>
<map name="mrpt_1_1graphs_1_1_c_graph_partitioner_inherit__map" id="mrpt_1_1graphs_1_1_c_graph_partitioner_inherit__map">
<area shape="rect" id="node2" href="classmrpt_1_1utils_1_1_c_debug_output_capable.html" title="This base class provides a common printf-like method to send debug information to std::cout..." alt="" coords="5,5,227,32"/></map>
<center><span class="legend">[<a href="graph_legend.html">legend</a>]</span></center></div>
<p><a href="classmrpt_1_1graphs_1_1_c_graph_partitioner-members.html">List of all members.</a></p>
<table class="memberdecls">
<tr><td colspan="2"><h2><a name="pub-static-methods"></a>
Static Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html#a57e4d57563d08822c554be19be4e74f3">RecursiveSpectralPartition</a> (<a class="el" href="classmrpt_1_1math_1_1_c_matrix.html">CMatrix</a> &in_A, <a class="el" href="classstd_1_1vector.html">std::vector</a>< <a class="el" href="namespacemrpt.html#aa4dc027dbc3804c847a78892a2982047">vector_uint</a> > &out_parts, float threshold_Ncut=1.0f, bool forceSimetry=true, bool useSpectralBisection=true, bool recursive=true, unsigned minSizeClusters=1)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Performs the spectral recursive partition into K-parts for a given graph. <a href="#a57e4d57563d08822c554be19be4e74f3"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html#a18a2a33ef8c2b73b426ed3b2cfef8180">SpectralBisection</a> (<a class="el" href="classmrpt_1_1math_1_1_c_matrix.html">CMatrix</a> &in_A, <a class="el" href="namespacemrpt.html#aa4dc027dbc3804c847a78892a2982047">vector_uint</a> &out_part1, <a class="el" href="namespacemrpt.html#aa4dc027dbc3804c847a78892a2982047">vector_uint</a> &out_part2, float &out_cut_value, bool forceSimetry=true)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Performs the spectral bisection of a graph. <a href="#a18a2a33ef8c2b73b426ed3b2cfef8180"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html#a26f1d57b8d715829a28fa1facd596ea3">exactBisection</a> (<a class="el" href="classmrpt_1_1math_1_1_c_matrix.html">CMatrix</a> &in_A, <a class="el" href="namespacemrpt.html#aa4dc027dbc3804c847a78892a2982047">vector_uint</a> &out_part1, <a class="el" href="namespacemrpt.html#aa4dc027dbc3804c847a78892a2982047">vector_uint</a> &out_part2, float &out_cut_value, bool forceSimetry=true)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Performs an EXACT minimum n-Cut graph bisection, (Use <a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html#a18a2a33ef8c2b73b426ed3b2cfef8180" title="Performs the spectral bisection of a graph.">CGraphPartitioner::SpectralBisection</a> for a faster algorithm) <a href="#a26f1d57b8d715829a28fa1facd596ea3"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static float </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html#a095c1afc86ea83d8cc04f1c0da7a30ad">nCut</a> (const <a class="el" href="classmrpt_1_1math_1_1_c_matrix.html">CMatrix</a> &in_A, const <a class="el" href="namespacemrpt.html#aa4dc027dbc3804c847a78892a2982047">vector_uint</a> &in_part1, const <a class="el" href="namespacemrpt.html#aa4dc027dbc3804c847a78892a2982047">vector_uint</a> &in_part2)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Returns the normaliced cut of a graph, given its adjacency matrix A and a bisection: <a href="#a095c1afc86ea83d8cc04f1c0da7a30ad"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1utils_1_1_c_debug_output_capable.html#ab78281b5d70d6e295a8527a10fea66de">printf_debug</a> (const char *frmt,...)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sends a formated text to "debugOut" if not NULL, or to cout otherwise. <a href="#ab78281b5d70d6e295a8527a10fea66de"></a><br/></td></tr>
<tr><td colspan="2"><h2><a name="pub-static-attribs"></a>
Static Public Attributes</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html#ad3c1e49fc3bf666ed5f1a3072a682fc5">DEBUG_SAVE_EIGENVECTOR_FILES</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">If set to true (default=false), each eigenvector computed (and the laplacian of the adj. <a href="#ad3c1e49fc3bf666ed5f1a3072a682fc5"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static bool </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html#a5ec28a998a6d61dd7cecc9e516670537">VERBOSE</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">If set to true (default=false), debug info will be displayed to cout. <a href="#a5ec28a998a6d61dd7cecc9e516670537"></a><br/></td></tr>
<tr><td colspan="2"><h2><a name="pri-static-attribs"></a>
Static Private Attributes</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static int </td><td class="memItemRight" valign="bottom"><a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html#a824d769d2eabe92dfde6211b29f2c711">debug_file_no</a></td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Used internally when DEBUG_SAVE_EIGENVECTOR_FILES=true. <a href="#a824d769d2eabe92dfde6211b29f2c711"></a><br/></td></tr>
</table>
<hr/><h2>Member Function Documentation</h2>
<a class="anchor" id="a26f1d57b8d715829a28fa1facd596ea3"></a><!-- doxytag: member="mrpt::graphs::CGraphPartitioner::exactBisection" ref="a26f1d57b8d715829a28fa1facd596ea3" args="(CMatrix &in_A, vector_uint &out_part1, vector_uint &out_part2, float &out_cut_value, bool forceSimetry=true)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static void mrpt::graphs::CGraphPartitioner::exactBisection </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classmrpt_1_1math_1_1_c_matrix.html">CMatrix</a> & </td>
<td class="paramname"><em>in_A</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="namespacemrpt.html#aa4dc027dbc3804c847a78892a2982047">vector_uint</a> & </td>
<td class="paramname"><em>out_part1</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="namespacemrpt.html#aa4dc027dbc3804c847a78892a2982047">vector_uint</a> & </td>
<td class="paramname"><em>out_part2</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">float & </td>
<td class="paramname"><em>out_cut_value</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool </td>
<td class="paramname"><em>forceSimetry</em> = <code>true</code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Performs an EXACT minimum n-Cut graph bisection, (Use <a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html#a18a2a33ef8c2b73b426ed3b2cfef8180" title="Performs the spectral bisection of a graph.">CGraphPartitioner::SpectralBisection</a> for a faster algorithm) </p>
<dl><dt><b>Parameters:</b></dt><dd>
<table class="params">
<tr><td class="paramname">in_A</td><td>[IN] The weights matrix for the graph. It must be a square matrix, where element W<sub>ij</sub> is the "likelihood" between nodes "i" and "j", and typically W<sub>ii</sub> = 1. </td></tr>
<tr><td class="paramname">out_part1</td><td>[OUT] The indexs of the nodes that fall into the first group. </td></tr>
<tr><td class="paramname">out_part2</td><td>[OUT] The indexs of the nodes that fall into the second group. </td></tr>
<tr><td class="paramname">out_cut_value</td><td>[OUT] The N-cut value for the proposed cut, in the range [0-2]. </td></tr>
<tr><td class="paramname">forceSimetry</td><td>[IN] If set to true (default) the elements W<sub>ij</sub> and W<sub>ji</sub> are replaced by 0.5·(W<sub>ij</sub>+W<sub>ji</sub>). Set to false if matrix is known to be simetric.</td></tr>
</table>
</dd>
</dl>
<dl class="see"><dt><b>See also:</b></dt><dd>CMatrix, <a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html#a57e4d57563d08822c554be19be4e74f3" title="Performs the spectral recursive partition into K-parts for a given graph.">RecursiveSpectralPartition</a></dd></dl>
<dl><dt><b>Exceptions:</b></dt><dd>
<table class="exception">
<tr><td class="paramname">Throws</td><td>a <a class="el" href="classstd_1_1logic__error.html" title="STL class.">std::logic_error</a> if an invalid matrix is passed. </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a class="anchor" id="a095c1afc86ea83d8cc04f1c0da7a30ad"></a><!-- doxytag: member="mrpt::graphs::CGraphPartitioner::nCut" ref="a095c1afc86ea83d8cc04f1c0da7a30ad" args="(const CMatrix &in_A, const vector_uint &in_part1, const vector_uint &in_part2)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static float mrpt::graphs::CGraphPartitioner::nCut </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="classmrpt_1_1math_1_1_c_matrix.html">CMatrix</a> & </td>
<td class="paramname"><em>in_A</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="namespacemrpt.html#aa4dc027dbc3804c847a78892a2982047">vector_uint</a> & </td>
<td class="paramname"><em>in_part1</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="namespacemrpt.html#aa4dc027dbc3804c847a78892a2982047">vector_uint</a> & </td>
<td class="paramname"><em>in_part2</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Returns the normaliced cut of a graph, given its adjacency matrix A and a bisection: </p>
</div>
</div>
<a class="anchor" id="ab78281b5d70d6e295a8527a10fea66de"></a><!-- doxytag: member="mrpt::graphs::CGraphPartitioner::printf_debug" ref="ab78281b5d70d6e295a8527a10fea66de" args="(const char *frmt,...)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static void mrpt::utils::CDebugOutputCapable::printf_debug </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"><em>frmt</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"> </td>
<td class="paramname"><em>...</em> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td><code> [static, inherited]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Sends a formated text to "debugOut" if not NULL, or to cout otherwise. </p>
<p>Referenced by <a class="el" href="_c_levenberg_marquardt_8h_source.html#l00098">mrpt::math::CLevenbergMarquardtTempl::execute()</a>.</p>
</div>
</div>
<a class="anchor" id="a57e4d57563d08822c554be19be4e74f3"></a><!-- doxytag: member="mrpt::graphs::CGraphPartitioner::RecursiveSpectralPartition" ref="a57e4d57563d08822c554be19be4e74f3" args="(CMatrix &in_A, std::vector< vector_uint > &out_parts, float threshold_Ncut=1.0f, bool forceSimetry=true, bool useSpectralBisection=true, bool recursive=true, unsigned minSizeClusters=1)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static void mrpt::graphs::CGraphPartitioner::RecursiveSpectralPartition </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classmrpt_1_1math_1_1_c_matrix.html">CMatrix</a> & </td>
<td class="paramname"><em>in_A</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="classstd_1_1vector.html">std::vector</a>< <a class="el" href="namespacemrpt.html#aa4dc027dbc3804c847a78892a2982047">vector_uint</a> > & </td>
<td class="paramname"><em>out_parts</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">float </td>
<td class="paramname"><em>threshold_Ncut</em> = <code>1.0f</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool </td>
<td class="paramname"><em>forceSimetry</em> = <code>true</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool </td>
<td class="paramname"><em>useSpectralBisection</em> = <code>true</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool </td>
<td class="paramname"><em>recursive</em> = <code>true</code>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned </td>
<td class="paramname"><em>minSizeClusters</em> = <code>1</code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Performs the spectral recursive partition into K-parts for a given graph. </p>
<p>The default threshold for the N-cut is 1, which correspond to a cut equal of the geometric mean of self-associations of each pair of groups.</p>
<dl><dt><b>Parameters:</b></dt><dd>
<table class="params">
<tr><td class="paramname">in_A</td><td>[IN] The weights matrix for the graph. It must be a square matrix, where element W<sub>ij</sub> is the "likelihood" between nodes "i" and "j", and typically W<sub>ii</sub> = 1. </td></tr>
<tr><td class="paramname">out_parts</td><td>[OUT] An array of partitions, where each partition is represented as a vector of indexs for nodes. </td></tr>
<tr><td class="paramname">threshold_Ncut</td><td>[IN] If it is desired to use other than the default threshold, it can be passed here. </td></tr>
<tr><td class="paramname">forceSimetry</td><td>[IN] If set to true (default) the elements W<sub>ij</sub> and W<sub>ji</sub> are replaced by 0.5·(W<sub>ij</sub>+W<sub>ji</sub>). Set to false if matrix is known to be simetric. </td></tr>
<tr><td class="paramname">useSpectralBisection</td><td>[IN] If set to true (default) a quick spectral bisection will be used. If set to false, a brute force, exact finding of the min-cut is performed. </td></tr>
<tr><td class="paramname">recursive</td><td>[IN] Default=true, recursive algorithm for finding N partitions. Set to false to force 1 bisection as maximum. </td></tr>
<tr><td class="paramname">minSizeClusters</td><td>[IN] Default=1, Minimum size of partitions to be accepted.</td></tr>
</table>
</dd>
</dl>
<dl class="see"><dt><b>See also:</b></dt><dd>CMatrix, <a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html#a18a2a33ef8c2b73b426ed3b2cfef8180" title="Performs the spectral bisection of a graph.">SpectralBisection</a></dd></dl>
<dl><dt><b>Exceptions:</b></dt><dd>
<table class="exception">
<tr><td class="paramname">Throws</td><td>a <a class="el" href="classstd_1_1logic__error.html" title="STL class.">std::logic_error</a> if an invalid matrix is passed. </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<a class="anchor" id="a18a2a33ef8c2b73b426ed3b2cfef8180"></a><!-- doxytag: member="mrpt::graphs::CGraphPartitioner::SpectralBisection" ref="a18a2a33ef8c2b73b426ed3b2cfef8180" args="(CMatrix &in_A, vector_uint &out_part1, vector_uint &out_part2, float &out_cut_value, bool forceSimetry=true)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static void mrpt::graphs::CGraphPartitioner::SpectralBisection </td>
<td>(</td>
<td class="paramtype"><a class="el" href="classmrpt_1_1math_1_1_c_matrix.html">CMatrix</a> & </td>
<td class="paramname"><em>in_A</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="namespacemrpt.html#aa4dc027dbc3804c847a78892a2982047">vector_uint</a> & </td>
<td class="paramname"><em>out_part1</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="namespacemrpt.html#aa4dc027dbc3804c847a78892a2982047">vector_uint</a> & </td>
<td class="paramname"><em>out_part2</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">float & </td>
<td class="paramname"><em>out_cut_value</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool </td>
<td class="paramname"><em>forceSimetry</em> = <code>true</code> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Performs the spectral bisection of a graph. </p>
<p>This method always perform the bisection, and a measure of the goodness for this cut is returned.</p>
<dl><dt><b>Parameters:</b></dt><dd>
<table class="params">
<tr><td class="paramname">in_A</td><td>[IN] The weights matrix for the graph. It must be a square matrix, where element W<sub>ij</sub> is the "likelihood" between nodes "i" and "j", and typically W<sub>ii</sub> = 1. </td></tr>
<tr><td class="paramname">out_part1</td><td>[OUT] The indexs of the nodes that fall into the first group. </td></tr>
<tr><td class="paramname">out_part2</td><td>[OUT] The indexs of the nodes that fall into the second group. </td></tr>
<tr><td class="paramname">out_cut_value</td><td>[OUT] The N-cut value for the proposed cut, in the range [0-2]. </td></tr>
<tr><td class="paramname">forceSimetry</td><td>[IN] If set to true (default) the elements W<sub>ij</sub> and W<sub>ji</sub> are replaced by 0.5·(W<sub>ij</sub>+W<sub>ji</sub>). Set to false if matrix is known to be simetric.</td></tr>
</table>
</dd>
</dl>
<dl class="see"><dt><b>See also:</b></dt><dd>CMatrix, <a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html#a57e4d57563d08822c554be19be4e74f3" title="Performs the spectral recursive partition into K-parts for a given graph.">RecursiveSpectralPartition</a></dd></dl>
<dl><dt><b>Exceptions:</b></dt><dd>
<table class="exception">
<tr><td class="paramname">Throws</td><td>a <a class="el" href="classstd_1_1logic__error.html" title="STL class.">std::logic_error</a> if an invalid matrix is passed. </td></tr>
</table>
</dd>
</dl>
</div>
</div>
<hr/><h2>Member Data Documentation</h2>
<a class="anchor" id="a824d769d2eabe92dfde6211b29f2c711"></a><!-- doxytag: member="mrpt::graphs::CGraphPartitioner::debug_file_no" ref="a824d769d2eabe92dfde6211b29f2c711" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int <a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html#a824d769d2eabe92dfde6211b29f2c711">mrpt::graphs::CGraphPartitioner::debug_file_no</a><code> [static, private]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>Used internally when DEBUG_SAVE_EIGENVECTOR_FILES=true. </p>
<p>Definition at line <a class="el" href="_c_graph_partitioner_8h_source.html#l00140">140</a> of file <a class="el" href="_c_graph_partitioner_8h_source.html">CGraphPartitioner.h</a>.</p>
</div>
</div>
<a class="anchor" id="ad3c1e49fc3bf666ed5f1a3072a682fc5"></a><!-- doxytag: member="mrpt::graphs::CGraphPartitioner::DEBUG_SAVE_EIGENVECTOR_FILES" ref="ad3c1e49fc3bf666ed5f1a3072a682fc5" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html#ad3c1e49fc3bf666ed5f1a3072a682fc5">mrpt::graphs::CGraphPartitioner::DEBUG_SAVE_EIGENVECTOR_FILES</a><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>If set to true (default=false), each eigenvector computed (and the laplacian of the adj. </p>
<p>matrix) will be saved to files "DEBUG_GRAPHPART_eigvectors_xxx" and "DEBUG_GRAPHPART_laplacian_xxx", respectively. </p>
<p>Definition at line <a class="el" href="_c_graph_partitioner_8h_source.html#l00131">131</a> of file <a class="el" href="_c_graph_partitioner_8h_source.html">CGraphPartitioner.h</a>.</p>
</div>
</div>
<a class="anchor" id="a5ec28a998a6d61dd7cecc9e516670537"></a><!-- doxytag: member="mrpt::graphs::CGraphPartitioner::VERBOSE" ref="a5ec28a998a6d61dd7cecc9e516670537" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="classmrpt_1_1graphs_1_1_c_graph_partitioner.html#a5ec28a998a6d61dd7cecc9e516670537">mrpt::graphs::CGraphPartitioner::VERBOSE</a><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>If set to true (default=false), debug info will be displayed to cout. </p>
<p>Definition at line <a class="el" href="_c_graph_partitioner_8h_source.html#l00135">135</a> of file <a class="el" href="_c_graph_partitioner_8h_source.html">CGraphPartitioner.h</a>.</p>
</div>
</div>
</div>
<br><hr><br> <table border="0" width="100%"> <tr> <td> Page generated by <a href="http://www.doxygen.org" target="_blank">Doxygen 1.7.5</a> for MRPT 0.9.5 SVN: at Sun Sep 25 17:20:18 UTC 2011</td><td></td> <td width="100"> </td> <td width="150"> </td></tr> </table> </body></html>
