<!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: dox/Infovis/vtkBoostKruskalMinimumSpanningTree.h Source File</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><a href="classes.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<h1>dox/Infovis/vtkBoostKruskalMinimumSpanningTree.h</h1><a href="a02996.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*=========================================================================</span>
<a name="l00002"></a>00002 <span class="comment"> </span>
<a name="l00003"></a>00003 <span class="comment">Program: Visualization Toolkit</span>
<a name="l00004"></a>00004 <span class="comment">Module: $RCSfile: vtkBoostKruskalMinimumSpanningTree.h,v $</span>
<a name="l00005"></a>00005 <span class="comment"></span>
<a name="l00006"></a>00006 <span class="comment">Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen</span>
<a name="l00007"></a>00007 <span class="comment">All rights reserved.</span>
<a name="l00008"></a>00008 <span class="comment">See Copyright.txt or http://www.kitware.com/Copyright.htm for details.</span>
<a name="l00009"></a>00009 <span class="comment"></span>
<a name="l00010"></a>00010 <span class="comment">This software is distributed WITHOUT ANY WARRANTY; without even</span>
<a name="l00011"></a>00011 <span class="comment">the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR</span>
<a name="l00012"></a>00012 <span class="comment">PURPOSE. See the above copyright notice for more information.</span>
<a name="l00013"></a>00013 <span class="comment"></span>
<a name="l00014"></a>00014 <span class="comment">=========================================================================*/</span>
<a name="l00015"></a>00015 <span class="comment">/*-------------------------------------------------------------------------</span>
<a name="l00016"></a>00016 <span class="comment"> Copyright 2008 Sandia Corporation.</span>
<a name="l00017"></a>00017 <span class="comment"> Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,</span>
<a name="l00018"></a>00018 <span class="comment"> the U.S. Government retains certain rights in this software.</span>
<a name="l00019"></a>00019 <span class="comment"> -------------------------------------------------------------------------*/</span>
<a name="l00034"></a>00034 <span class="preprocessor">#ifndef __vtkBoostKruskalMinimumSpanningTree_h</span>
<a name="l00035"></a>00035 <span class="preprocessor"></span><span class="preprocessor">#define __vtkBoostKruskalMinimumSpanningTree_h</span>
<a name="l00036"></a>00036 <span class="preprocessor"></span>
<a name="l00037"></a>00037 <span class="preprocessor">#include "<a class="code" href="a02135.html">vtkStdString.h</a>"</span> <span class="comment">// For string type</span>
<a name="l00038"></a>00038 <span class="preprocessor">#include "<a class="code" href="a02159.html">vtkVariant.h</a>"</span> <span class="comment">// For variant type</span>
<a name="l00039"></a>00039
<a name="l00040"></a>00040 <span class="preprocessor">#include "<a class="code" href="a02357.html">vtkSelectionAlgorithm.h</a>"</span>
<a name="l00041"></a>00041
<a name="l00042"></a><a class="code" href="a00186.html">00042</a> <span class="keyword">class </span><a class="code" href="a02170.html#73f1c245b8811be3c4b76b0a89784e70">VTK_INFOVIS_EXPORT</a> <a class="code" href="a00186.html" title="Contructs a minimum spanning tree from a graph and the weighting array.">vtkBoostKruskalMinimumSpanningTree</a> : <span class="keyword">public</span> <a class="code" href="a01523.html" title="Superclass for algorithms that produce only Selection as output.">vtkSelectionAlgorithm</a>
<a name="l00043"></a>00043 {
<a name="l00044"></a>00044 <span class="keyword">public</span>:
<a name="l00045"></a>00045 <span class="keyword">static</span> <a class="code" href="a00186.html" title="Contructs a minimum spanning tree from a graph and the weighting array.">vtkBoostKruskalMinimumSpanningTree</a> *<a class="code" href="a01523.html#7a1145160a48d50e409b41ac9aa4f34b">New</a>();
<a name="l00046"></a><a class="code" href="a00186.html#2b3960af2ee35149a340c56f4f731025">00046</a> vtkTypeRevisionMacro(<a class="code" href="a00186.html" title="Contructs a minimum spanning tree from a graph and the weighting array.">vtkBoostKruskalMinimumSpanningTree</a>, <a class="code" href="a01523.html" title="Superclass for algorithms that produce only Selection as output.">vtkSelectionAlgorithm</a>);
<a name="l00047"></a>00047 <span class="keywordtype">void</span> <a class="code" href="a01523.html#ef2cc527862032a26b5ba27f9b514480">PrintSelf</a>(ostream& os, <a class="code" href="a00869.html" title="a simple class to control print indentation">vtkIndent</a> indent);
<a name="l00048"></a>00048
<a name="l00050"></a>00050
<a name="l00054"></a>00054 vtkSetStringMacro(EdgeWeightArrayName);
<a name="l00056"></a>00056
<a name="l00058"></a>00058
<a name="l00061"></a>00061 vtkSetStringMacro(OutputSelectionType);
<a name="l00063"></a>00063
<a name="l00065"></a>00065
<a name="l00069"></a>00069 <span class="keywordtype">void</span> SetNegateEdgeWeights(<span class="keywordtype">bool</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2106bf5e5151797630e91167caab3f22b9a">value</a>);
<a name="l00070"></a>00070 vtkGetMacro(NegateEdgeWeights, <span class="keywordtype">bool</span>);
<a name="l00071"></a>00071 vtkBooleanMacro(NegateEdgeWeights, <span class="keywordtype">bool</span>);
<a name="l00073"></a>00073
<a name="l00074"></a>00074 <span class="keyword">protected</span>:
<a name="l00075"></a>00075 <a class="code" href="a00186.html" title="Contructs a minimum spanning tree from a graph and the weighting array.">vtkBoostKruskalMinimumSpanningTree</a>();
<a name="l00076"></a>00076 ~<a class="code" href="a00186.html" title="Contructs a minimum spanning tree from a graph and the weighting array.">vtkBoostKruskalMinimumSpanningTree</a>();
<a name="l00077"></a>00077
<a name="l00078"></a>00078 <span class="keywordtype">int</span> <a class="code" href="a01523.html#a02476a7ee4b1a71b02edf027139cddd">RequestData</a>(
<a name="l00079"></a>00079 <a class="code" href="a00872.html" title="Store vtkAlgorithm input/output information.">vtkInformation</a> *,
<a name="l00080"></a>00080 <a class="code" href="a00895.html" title="Store zero or more vtkInformation instances.">vtkInformationVector</a> **,
<a name="l00081"></a>00081 <a class="code" href="a00895.html" title="Store zero or more vtkInformation instances.">vtkInformationVector</a> *);
<a name="l00082"></a>00082
<a name="l00083"></a>00083 <span class="keywordtype">int</span> <a class="code" href="a01523.html#c4ebef15817b841ea2301fcf7b99c3c8">FillInputPortInformation</a>(
<a name="l00084"></a>00084 <span class="keywordtype">int</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d210710cb6d12e418b21e8fb3d79ac32f51c">port</a>, <a class="code" href="a00872.html" title="Store vtkAlgorithm input/output information.">vtkInformation</a>* <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d21023da246d4a744e861548382bb79fad81">info</a>);
<a name="l00085"></a>00085
<a name="l00086"></a>00086 <span class="keywordtype">int</span> <a class="code" href="a01523.html#8dc6f2da089719202ebf2d32da30ef71">FillOutputPortInformation</a>(
<a name="l00087"></a>00087 <span class="keywordtype">int</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d210710cb6d12e418b21e8fb3d79ac32f51c">port</a>, <a class="code" href="a00872.html" title="Store vtkAlgorithm input/output information.">vtkInformation</a>* <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d21023da246d4a744e861548382bb79fad81">info</a>);
<a name="l00088"></a>00088
<a name="l00089"></a>00089 <span class="keyword">private</span>:
<a name="l00090"></a>00090 <span class="keywordtype">char</span>* EdgeWeightArrayName;
<a name="l00091"></a>00091 <span class="keywordtype">char</span>* OutputSelectionType;
<a name="l00092"></a>00092 <span class="keywordtype">bool</span> NegateEdgeWeights;
<a name="l00093"></a>00093 <span class="keywordtype">float</span> EdgeWeightMultiplier;
<a name="l00094"></a>00094
<a name="l00095"></a>00095 <a class="code" href="a00186.html" title="Contructs a minimum spanning tree from a graph and the weighting array.">vtkBoostKruskalMinimumSpanningTree</a>(<span class="keyword">const</span> <a class="code" href="a00186.html" title="Contructs a minimum spanning tree from a graph and the weighting array.">vtkBoostKruskalMinimumSpanningTree</a>&); <span class="comment">// Not implemented.</span>
<a name="l00096"></a>00096 <span class="keywordtype">void</span> operator=(<span class="keyword">const</span> <a class="code" href="a00186.html" title="Contructs a minimum spanning tree from a graph and the weighting array.">vtkBoostKruskalMinimumSpanningTree</a>&); <span class="comment">// Not implemented.</span>
<a name="l00097"></a>00097 };
<a name="l00098"></a>00098
<a name="l00099"></a>00099 <span class="preprocessor">#endif</span>
</pre></div></div>
<hr size="1"><address style="text-align: right;"><small>Generated on Wed Jun 3 18:35:36 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
>
4788
