<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>VTK: vtkBoostKruskalMinimumSpanningTree Class Reference</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.6 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<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="namespaces.html"><span>Namespaces</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>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="classes.html"><span>Alphabetical List</span></a></li>
<li><a href="annotated.html"><span>Class List</span></a></li>
<li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li>
<li><a href="functions.html"><span>Class Members</span></a></li>
</ul>
</div>
</div>
<div class="contents">
<h1>vtkBoostKruskalMinimumSpanningTree Class Reference</h1><!-- doxytag: class="vtkBoostKruskalMinimumSpanningTree" --><!-- doxytag: inherits="vtkSelectionAlgorithm" --><code>#include <<a class="el" href="a04786.html">vtkBoostKruskalMinimumSpanningTree.h</a>></code>
<p>
<div class="dynheader">
Inheritance diagram for vtkBoostKruskalMinimumSpanningTree:</div>
<div class="dynsection">
<p><center><img src="a08204.png" border="0" usemap="#a08205" alt="Inheritance graph"></center>
<map name="a08205">
<area shape="rect" href="a01523.html" title="Superclass for algorithms that produce only Selection as output." alt="" coords="59,229,213,256"><area shape="rect" href="a00101.html" title="Superclass for all sources, filters, and sinks in VTK." alt="" coords="87,155,185,181"><area shape="rect" href="a01084.html" title="abstract base class for most VTK objects" alt="" coords="96,80,176,107"><area shape="rect" href="a01085.html" title="abstract base class for most VTK objects" alt="" coords="81,5,191,32"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
<div class="dynheader">
Collaboration diagram for vtkBoostKruskalMinimumSpanningTree:</div>
<div class="dynsection">
<p><center><img src="a08206.png" border="0" usemap="#a08207" alt="Collaboration graph"></center>
<map name="a08207">
<area shape="rect" href="a01523.html" title="Superclass for algorithms that produce only Selection as output." alt="" coords="173,499,328,525"><area shape="rect" href="a00101.html" title="Superclass for all sources, filters, and sinks in VTK." alt="" coords="281,381,380,408"><area shape="rect" href="a00472.html" title="Superclass for all pipeline executives in VTK." alt="" coords="477,499,576,525"><area shape="rect" href="a01084.html" title="abstract base class for most VTK objects" alt="" coords="407,173,487,200"><area shape="rect" href="a00895.html" title="Store zero or more vtkInformation instances." alt="" coords="404,264,553,291"><area shape="rect" href="a00872.html" title="Store vtkAlgorithm input/output information." alt="" coords="212,264,321,291"><area shape="rect" href="a01085.html" title="abstract base class for most VTK objects" alt="" coords="164,5,273,32"><area shape="rect" href="a00884.html" title="internal structure for vtkInformation" alt="" coords="5,173,168,200"><area shape="rect" href="a00886.html" title="Superclass for vtkInformation keys." alt="" coords="153,83,284,109"><area shape="rect" href="a01719.html" title="record modification and/or execution time" alt="" coords="308,83,417,109"><area shape="rect" href="a00891.html" title="Key for pointer to pointer." alt="" coords="192,173,373,200"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
<p>
<a href="a08208.html">List of all members.</a><hr><a name="_details"></a><h2>Detailed Description</h2>
Contructs a minimum spanning tree from a graph and the weighting array.
<p>
This vtk class uses the Boost Kruskal Minimum Spanning Tree generic algorithm to perform a minimum spanning tree creation given a weighting value for each of the edges in the input graph.<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> vtkBoostGraphAdapter </dd></dl>
<p>Definition at line <a class="el" href="a04786.html#l00042">42</a> of file <a class="el" href="a04786.html">vtkBoostKruskalMinimumSpanningTree.h</a>.</p>
<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 <a class="el" href="a01523.html">vtkSelectionAlgorithm</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#2b3960af2ee35149a340c56f4f731025">Superclass</a></td></tr>
<tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual const char * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#2cbe13b5d15d3ee25fde63ebe29b0384">GetClassName</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#f7bc360ab107b7a4a85713799a252e29">IsA</a> (const char *type)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#9a4fa15763c5a9fcea2bedb5f45edbba">PrintSelf</a> (ostream &os, <a class="el" href="a00869.html">vtkIndent</a> indent)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#5e7b8be0178a1a719722a6091a4842ca">SetEdgeWeightArrayName</a> (const char *)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#cf6173b4f297b9ef319de83991dc6c48">SetOutputSelectionType</a> (const char *)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#51c3852e95f4e86622c567aabdf9c370">SetNegateEdgeWeights</a> (bool value)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#e5bcd03d3da40fb5850243ae69f012e1">GetNegateEdgeWeights</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#1867ea306faf3d2f0bafc233b71dfd87">NegateEdgeWeightsOn</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#1b77723590985f2d96f0cf9c7694c652">NegateEdgeWeightsOff</a> ()</td></tr>
<tr><td colspan="2"><br><h2>Static Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static <br>
<a class="el" href="a00186.html">vtkBoostKruskalMinimumSpanningTree</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#e9d3126df70ee2c160981949ab7ba1d2">New</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#db595409013c8ec85173658128c28f62">IsTypeOf</a> (const char *type)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static <br>
<a class="el" href="a00186.html">vtkBoostKruskalMinimumSpanningTree</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#359402611d5999900547a46b10ab5774">SafeDownCast</a> (<a class="el" href="a01084.html">vtkObject</a> *o)</td></tr>
<tr><td colspan="2"><br><h2>Protected Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#ec41ff9bc00abf2eeb88b9c0a6d314e3">vtkBoostKruskalMinimumSpanningTree</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#0f0dcb4e6afee5d89f49a9e736f1c8f5">~vtkBoostKruskalMinimumSpanningTree</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#35d94a89211241ce08491e8905f4ca31">RequestData</a> (<a class="el" href="a00872.html">vtkInformation</a> *, <a class="el" href="a00895.html">vtkInformationVector</a> **, <a class="el" href="a00895.html">vtkInformationVector</a> *)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#47d8a5c4a8119da99af487d9871a0fbf">FillInputPortInformation</a> (int port, <a class="el" href="a00872.html">vtkInformation</a> *info)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00186.html#c17066b45e0cab73ac0962cfb84f97d0">FillOutputPortInformation</a> (int port, <a class="el" href="a00872.html">vtkInformation</a> *info)</td></tr>
</table>
<hr><h2>Member Typedef Documentation</h2>
<a class="anchor" name="2b3960af2ee35149a340c56f4f731025"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::Superclass" ref="2b3960af2ee35149a340c56f4f731025" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="a01523.html">vtkSelectionAlgorithm</a> <a class="el" href="a01523.html">vtkBoostKruskalMinimumSpanningTree::Superclass</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Reimplemented from <a class="el" href="a01523.html#550c62fecd78016142e2fc6b81e8f876">vtkSelectionAlgorithm</a>.</p>
<p>Definition at line <a class="el" href="a04786.html#l00046">46</a> of file <a class="el" href="a04786.html">vtkBoostKruskalMinimumSpanningTree.h</a>.</p>
</div>
</div><p>
<hr><h2>Constructor & Destructor Documentation</h2>
<a class="anchor" name="ec41ff9bc00abf2eeb88b9c0a6d314e3"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::vtkBoostKruskalMinimumSpanningTree" ref="ec41ff9bc00abf2eeb88b9c0a6d314e3" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">vtkBoostKruskalMinimumSpanningTree::vtkBoostKruskalMinimumSpanningTree </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<a class="anchor" name="0f0dcb4e6afee5d89f49a9e736f1c8f5"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::~vtkBoostKruskalMinimumSpanningTree" ref="0f0dcb4e6afee5d89f49a9e736f1c8f5" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">vtkBoostKruskalMinimumSpanningTree::~vtkBoostKruskalMinimumSpanningTree </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="e9d3126df70ee2c160981949ab7ba1d2"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::New" ref="e9d3126df70ee2c160981949ab7ba1d2" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static <a class="el" href="a00186.html">vtkBoostKruskalMinimumSpanningTree</a>* vtkBoostKruskalMinimumSpanningTree::New </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
<p>Reimplemented from <a class="el" href="a01523.html#7a1145160a48d50e409b41ac9aa4f34b">vtkSelectionAlgorithm</a>.</p>
</div>
</div><p>
<a class="anchor" name="2cbe13b5d15d3ee25fde63ebe29b0384"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::GetClassName" ref="2cbe13b5d15d3ee25fde63ebe29b0384" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual const char* vtkBoostKruskalMinimumSpanningTree::GetClassName </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Reimplemented from <a class="el" href="a01523.html#e7b8c77004d5d518f12748ea343dd4ef">vtkSelectionAlgorithm</a>.</p>
</div>
</div><p>
<a class="anchor" name="db595409013c8ec85173658128c28f62"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::IsTypeOf" ref="db595409013c8ec85173658128c28f62" args="(const char *type)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static int vtkBoostKruskalMinimumSpanningTree::IsTypeOf </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"> <em>name</em> </td>
<td> ) </td>
<td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeRevisionMacro found in vtkSetGet.h.
<p>Reimplemented from <a class="el" href="a01523.html#fd2231a8956f7de9f91326bfe0279ea1">vtkSelectionAlgorithm</a>.</p>
</div>
</div><p>
<a class="anchor" name="f7bc360ab107b7a4a85713799a252e29"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::IsA" ref="f7bc360ab107b7a4a85713799a252e29" args="(const char *type)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual int vtkBoostKruskalMinimumSpanningTree::IsA </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"> <em>name</em> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeRevisionMacro found in vtkSetGet.h.
<p>Reimplemented from <a class="el" href="a01523.html#8801d0d1c521f3b53abc08448f82db79">vtkSelectionAlgorithm</a>.</p>
</div>
</div><p>
<a class="anchor" name="359402611d5999900547a46b10ab5774"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::SafeDownCast" ref="359402611d5999900547a46b10ab5774" args="(vtkObject *o)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static <a class="el" href="a00186.html">vtkBoostKruskalMinimumSpanningTree</a>* vtkBoostKruskalMinimumSpanningTree::SafeDownCast </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01084.html">vtkObject</a> * </td>
<td class="paramname"> <em>o</em> </td>
<td> ) </td>
<td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Reimplemented from <a class="el" href="a01523.html#a6454625c2c152b8b5862eaf616b7f45">vtkSelectionAlgorithm</a>.</p>
</div>
</div><p>
<a class="anchor" name="9a4fa15763c5a9fcea2bedb5f45edbba"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::PrintSelf" ref="9a4fa15763c5a9fcea2bedb5f45edbba" args="(ostream &os, vtkIndent indent)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkBoostKruskalMinimumSpanningTree::PrintSelf </td>
<td>(</td>
<td class="paramtype">ostream & </td>
<td class="paramname"> <em>os</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00869.html">vtkIndent</a> </td>
<td class="paramname"> <em>indent</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Methods invoked by print to print information about the object including superclasses. Typically not called by the user (use <a class="el" href="a01085.html#edadf6378465fd81c2592ef64262e2a5">Print()</a> instead) but used in the hierarchical print process to combine the output of several classes.
<p>Reimplemented from <a class="el" href="a01523.html#ef2cc527862032a26b5ba27f9b514480">vtkSelectionAlgorithm</a>.</p>
</div>
</div><p>
<a class="anchor" name="5e7b8be0178a1a719722a6091a4842ca"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::SetEdgeWeightArrayName" ref="5e7b8be0178a1a719722a6091a4842ca" args="(const char *)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkBoostKruskalMinimumSpanningTree::SetEdgeWeightArrayName </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Set the name of the edge-weight input array, which must name an array that is part of the edge data of the input graph and contains numeric data. If the edge-weight array is not of type <a class="el" href="a00436.html" title="dynamic, self-adjusting array of double">vtkDoubleArray</a>, the array will be copied into a temporary <a class="el" href="a00436.html" title="dynamic, self-adjusting array of double">vtkDoubleArray</a>.
</div>
</div><p>
<a class="anchor" name="cf6173b4f297b9ef319de83991dc6c48"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::SetOutputSelectionType" ref="cf6173b4f297b9ef319de83991dc6c48" args="(const char *)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkBoostKruskalMinimumSpanningTree::SetOutputSelectionType </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Set the output selection type. The default is to use the the set of minimum spanning tree edges "MINIMUM_SPANNING_TREE_EDGES". No other options are defined.
</div>
</div><p>
<a class="anchor" name="51c3852e95f4e86622c567aabdf9c370"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::SetNegateEdgeWeights" ref="51c3852e95f4e86622c567aabdf9c370" args="(bool value)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkBoostKruskalMinimumSpanningTree::SetNegateEdgeWeights </td>
<td>(</td>
<td class="paramtype">bool </td>
<td class="paramname"> <em>value</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Whether to negate the edge weights. By negating the edge weights this algorithm will give you the 'maximal' spanning tree (i.e. the algorithm will try to create a spanning tree with the highest weighted edges). Defaulted to Off. FIXME: put a real definition in...
</div>
</div><p>
<a class="anchor" name="e5bcd03d3da40fb5850243ae69f012e1"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::GetNegateEdgeWeights" ref="e5bcd03d3da40fb5850243ae69f012e1" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual bool vtkBoostKruskalMinimumSpanningTree::GetNegateEdgeWeights </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Whether to negate the edge weights. By negating the edge weights this algorithm will give you the 'maximal' spanning tree (i.e. the algorithm will try to create a spanning tree with the highest weighted edges). Defaulted to Off. FIXME: put a real definition in...
</div>
</div><p>
<a class="anchor" name="1867ea306faf3d2f0bafc233b71dfd87"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::NegateEdgeWeightsOn" ref="1867ea306faf3d2f0bafc233b71dfd87" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkBoostKruskalMinimumSpanningTree::NegateEdgeWeightsOn </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Whether to negate the edge weights. By negating the edge weights this algorithm will give you the 'maximal' spanning tree (i.e. the algorithm will try to create a spanning tree with the highest weighted edges). Defaulted to Off. FIXME: put a real definition in...
</div>
</div><p>
<a class="anchor" name="1b77723590985f2d96f0cf9c7694c652"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::NegateEdgeWeightsOff" ref="1b77723590985f2d96f0cf9c7694c652" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkBoostKruskalMinimumSpanningTree::NegateEdgeWeightsOff </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Whether to negate the edge weights. By negating the edge weights this algorithm will give you the 'maximal' spanning tree (i.e. the algorithm will try to create a spanning tree with the highest weighted edges). Defaulted to Off. FIXME: put a real definition in...
</div>
</div><p>
<a class="anchor" name="35d94a89211241ce08491e8905f4ca31"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::RequestData" ref="35d94a89211241ce08491e8905f4ca31" args="(vtkInformation *, vtkInformationVector **, vtkInformationVector *)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int vtkBoostKruskalMinimumSpanningTree::RequestData </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00872.html">vtkInformation</a> * </td>
<td class="paramname"> <em>request</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00895.html">vtkInformationVector</a> ** </td>
<td class="paramname"> <em>inputVector</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00895.html">vtkInformationVector</a> * </td>
<td class="paramname"> <em>outputVector</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [protected, virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
This is called by the superclass. This is the method you should override.
<p>Reimplemented from <a class="el" href="a01523.html#a02476a7ee4b1a71b02edf027139cddd">vtkSelectionAlgorithm</a>.</p>
</div>
</div><p>
<a class="anchor" name="47d8a5c4a8119da99af487d9871a0fbf"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::FillInputPortInformation" ref="47d8a5c4a8119da99af487d9871a0fbf" args="(int port, vtkInformation *info)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int vtkBoostKruskalMinimumSpanningTree::FillInputPortInformation </td>
<td>(</td>
<td class="paramtype">int </td>
<td class="paramname"> <em>port</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00872.html">vtkInformation</a> * </td>
<td class="paramname"> <em>info</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [protected, virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Fill the input port information objects for this algorithm. This is invoked by the first call to GetInputPortInformation for each port so subclasses can specify what they can handle.
<p>Reimplemented from <a class="el" href="a01523.html#c4ebef15817b841ea2301fcf7b99c3c8">vtkSelectionAlgorithm</a>.</p>
</div>
</div><p>
<a class="anchor" name="c17066b45e0cab73ac0962cfb84f97d0"></a><!-- doxytag: member="vtkBoostKruskalMinimumSpanningTree::FillOutputPortInformation" ref="c17066b45e0cab73ac0962cfb84f97d0" args="(int port, vtkInformation *info)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int vtkBoostKruskalMinimumSpanningTree::FillOutputPortInformation </td>
<td>(</td>
<td class="paramtype">int </td>
<td class="paramname"> <em>port</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00872.html">vtkInformation</a> * </td>
<td class="paramname"> <em>info</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [protected, virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Fill the output port information objects for this algorithm. This is invoked by the first call to GetOutputPortInformation for each port so subclasses can specify what they can handle.
<p>Reimplemented from <a class="el" href="a01523.html#8dc6f2da089719202ebf2d32da30ef71">vtkSelectionAlgorithm</a>.</p>
</div>
</div><p>
<hr>The documentation for this class was generated from the following file:<ul>
<li>dox/Infovis/<a class="el" href="a04786.html">vtkBoostKruskalMinimumSpanningTree.h</a></ul>
</div>
<hr size="1"><address style="text-align: right;"><small>Generated on Wed Jun 3 18:54:26 2009 for VTK by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.6 </small></address>
</body>
</html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
60f1dc962abad0f3b492991a4fbef9be
>
files
>
189
