<!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/vtkBoostGraphAdapter.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/vtkBoostGraphAdapter.h</h1><a href="a02995.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: vtkBoostGraphAdapter.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="l00029"></a>00029 <span class="preprocessor">#ifndef __vtkBoostGraphAdapter_h</span>
<a name="l00030"></a>00030 <span class="preprocessor"></span><span class="preprocessor">#define __vtkBoostGraphAdapter_h</span>
<a name="l00031"></a>00031 <span class="preprocessor"></span>
<a name="l00032"></a>00032 <span class="preprocessor">#include "<a class="code" href="a01968.html">vtkAbstractArray.h</a>"</span>
<a name="l00033"></a>00033 <span class="preprocessor">#include "<a class="code" href="a02239.html">vtkDirectedGraph.h</a>"</span>
<a name="l00034"></a>00034 <span class="preprocessor">#include "<a class="code" href="a02241.html">vtkDistributedGraphHelper.h</a>"</span>
<a name="l00035"></a>00035 <span class="preprocessor">#include "<a class="code" href="a02221.html">vtkDataObject.h</a>"</span>
<a name="l00036"></a>00036 <span class="preprocessor">#include "<a class="code" href="a02005.html">vtkDataArray.h</a>"</span>
<a name="l00037"></a>00037 <span class="preprocessor">#include "<a class="code" href="a02014.html">vtkDoubleArray.h</a>"</span>
<a name="l00038"></a>00038 <span class="preprocessor">#include "<a class="code" href="a02023.html">vtkFloatArray.h</a>"</span>
<a name="l00039"></a>00039 <span class="preprocessor">#include "<a class="code" href="a02035.html">vtkIdTypeArray.h</a>"</span>
<a name="l00040"></a>00040 <span class="preprocessor">#include "<a class="code" href="a02039.html">vtkInformation.h</a>"</span>
<a name="l00041"></a>00041 <span class="preprocessor">#include "<a class="code" href="a02063.html">vtkIntArray.h</a>"</span>
<a name="l00042"></a>00042 <span class="preprocessor">#include "<a class="code" href="a02309.html">vtkMutableDirectedGraph.h</a>"</span>
<a name="l00043"></a>00043 <span class="preprocessor">#include "<a class="code" href="a02310.html">vtkMutableUndirectedGraph.h</a>"</span>
<a name="l00044"></a>00044 <span class="preprocessor">#include "<a class="code" href="a02385.html">vtkTree.h</a>"</span>
<a name="l00045"></a>00045 <span class="preprocessor">#include "<a class="code" href="a02392.html">vtkUndirectedGraph.h</a>"</span>
<a name="l00046"></a>00046 <span class="preprocessor">#include "<a class="code" href="a02159.html">vtkVariant.h</a>"</span>
<a name="l00047"></a>00047 <span class="preprocessor">#include <stddef.h></span> <span class="comment">// for ptrdiff_t</span>
<a name="l00048"></a>00048
<a name="l00049"></a>00049 <span class="keyword">namespace </span>boost {
<a name="l00050"></a>00050 <span class="comment">//===========================================================================</span>
<a name="l00051"></a>00051 <span class="comment">// VTK arrays as property maps</span>
<a name="l00052"></a>00052 <span class="comment">// These need to be defined before including other boost stuff</span>
<a name="l00053"></a>00053
<a name="l00054"></a>00054 <span class="comment">// Forward declarations are required here, so that we aren't forced</span>
<a name="l00055"></a>00055 <span class="comment">// to include boost/property_map.hpp.</span>
<a name="l00056"></a>00056 <span class="keyword">template</span><<span class="keyword">typename</span>> <span class="keyword">class </span>property_traits;
<a name="l00057"></a>00057 <span class="keyword">class </span>read_write_property_map_tag;
<a name="l00058"></a>00058
<a name="l00059"></a><a class="code" href="a02995.html#78a7eac0bf40b78e421f13a6f40eba95">00059</a> <span class="preprocessor">#define vtkPropertyMapMacro(T, V) \</span>
<a name="l00060"></a>00060 <span class="preprocessor"> template <> \</span>
<a name="l00061"></a>00061 <span class="preprocessor"> struct property_traits<T*> \</span>
<a name="l00062"></a>00062 <span class="preprocessor"> { \</span>
<a name="l00063"></a>00063 <span class="preprocessor"> typedef V value_type; \</span>
<a name="l00064"></a>00064 <span class="preprocessor"> typedef V reference; \</span>
<a name="l00065"></a>00065 <span class="preprocessor"> typedef vtkIdType key_type; \</span>
<a name="l00066"></a>00066 <span class="preprocessor"> typedef read_write_property_map_tag category; \</span>
<a name="l00067"></a>00067 <span class="preprocessor"> }; \</span>
<a name="l00068"></a>00068 <span class="preprocessor"> \</span>
<a name="l00069"></a>00069 <span class="preprocessor"> inline property_traits<T*>::reference \</span>
<a name="l00070"></a>00070 <span class="preprocessor"> get( \</span>
<a name="l00071"></a>00071 <span class="preprocessor"> T* const & arr, \</span>
<a name="l00072"></a>00072 <span class="preprocessor"> property_traits<T*>::key_type key) \</span>
<a name="l00073"></a>00073 <span class="preprocessor"> { \</span>
<a name="l00074"></a>00074 <span class="preprocessor"> return arr->GetValue(key); \</span>
<a name="l00075"></a>00075 <span class="preprocessor"> } \</span>
<a name="l00076"></a>00076 <span class="preprocessor"> \</span>
<a name="l00077"></a>00077 <span class="preprocessor"> inline void \</span>
<a name="l00078"></a>00078 <span class="preprocessor"> put( \</span>
<a name="l00079"></a>00079 <span class="preprocessor"> T* arr, \</span>
<a name="l00080"></a>00080 <span class="preprocessor"> property_traits<T*>::key_type key, \</span>
<a name="l00081"></a>00081 <span class="preprocessor"> const property_traits<T*>::value_type & value) \</span>
<a name="l00082"></a>00082 <span class="preprocessor"> { \</span>
<a name="l00083"></a>00083 <span class="preprocessor"> arr->InsertValue(key, value); \</span>
<a name="l00084"></a>00084 <span class="preprocessor"> }</span>
<a name="l00085"></a>00085 <span class="preprocessor"></span>
<a name="l00086"></a>00086 <a class="code" href="a03753.html#13490975c1985707d0ae2e9a0c01d9c5">vtkPropertyMapMacro</a>(<a class="code" href="a00900.html" title="dynamic, self-adjusting array of int">vtkIntArray</a>, <span class="keywordtype">int</span>)
<a name="l00087"></a>00087 <a class="code" href="a03753.html#13490975c1985707d0ae2e9a0c01d9c5">vtkPropertyMapMacro</a>(<a class="code" href="a00722.html" title="dynamic, self-adjusting array of vtkIdType">vtkIdTypeArray</a>, <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a>)
<a name="l00088"></a>00088 <a class="code" href="a03753.html#13490975c1985707d0ae2e9a0c01d9c5">vtkPropertyMapMacro</a>(<a class="code" href="a00436.html" title="dynamic, self-adjusting array of double">vtkDoubleArray</a>, <span class="keywordtype">double</span>)
<a name="l00089"></a>00089 <a class="code" href="a03753.html#13490975c1985707d0ae2e9a0c01d9c5">vtkPropertyMapMacro</a>(<a class="code" href="a00556.html" title="dynamic, self-adjusting array of float">vtkFloatArray</a>, <span class="keywordtype">float</span>)
<a name="l00090"></a>00090
<a name="l00091"></a>00091 <span class="comment">// vtkDataArray</span>
<a name="l00092"></a>00092 template<>
<a name="l00093"></a><a class="code" href="a00057.html">00093</a> struct property_traits<<a class="code" href="a00356.html" title="abstract superclass for arrays of numeric data">vtkDataArray</a>*>
<a name="l00094"></a>00094 {
<a name="l00095"></a><a class="code" href="a00057.html#23840d0b4e72753e2a51f180351bb331">00095</a> <span class="keyword">typedef</span> <span class="keywordtype">double</span> value_type;
<a name="l00096"></a><a class="code" href="a00057.html#61d893d1d93a2bc5e890c705a7e292c7">00096</a> <span class="keyword">typedef</span> <span class="keywordtype">double</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d21007cdaec72795b9d958f3051ff223566a">reference</a>;
<a name="l00097"></a><a class="code" href="a00057.html#fe2efb6d9beb73ecb26eecf263b42f3b">00097</a> <span class="keyword">typedef</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> key_type;
<a name="l00098"></a><a class="code" href="a00057.html#b6cd0a9fc8af3b5eb2f051a5ed36cd1d">00098</a> <span class="keyword">typedef</span> read_write_property_map_tag category;
<a name="l00099"></a>00099 };
<a name="l00100"></a>00100
<a name="l00101"></a>00101 <span class="keyword">inline</span> <span class="keywordtype">double</span>
<a name="l00102"></a><a class="code" href="a03753.html#7215e55fad68c1e07b8a0c1b3c2f2aa1">00102</a> <span class="keyword">get</span>(<a class="code" href="a00356.html" title="abstract superclass for arrays of numeric data">vtkDataArray</a> * <span class="keyword">const</span>& arr, <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>)
<a name="l00103"></a>00103 {
<a name="l00104"></a>00104 <span class="keywordflow">return</span> arr->GetTuple1(<a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>);
<a name="l00105"></a>00105 }
<a name="l00106"></a>00106
<a name="l00107"></a>00107 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00108"></a><a class="code" href="a03753.html#e0ff0b306e9b57cced90d018255a704f">00108</a> <a class="code" href="a03753.html#e0ff0b306e9b57cced90d018255a704f">put</a>(<a class="code" href="a00356.html" title="abstract superclass for arrays of numeric data">vtkDataArray</a> *arr, <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>, <span class="keyword">const</span> <span class="keywordtype">double</span>& <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2106bf5e5151797630e91167caab3f22b9a">value</a>)
<a name="l00109"></a>00109 {
<a name="l00110"></a>00110 arr-><a class="code" href="a00356.html#5a56d1e221a51d9c4bbbc97e5b604233">SetTuple1</a>(key, value);
<a name="l00111"></a>00111 }
<a name="l00112"></a>00112
<a name="l00113"></a>00113 <span class="comment">// vtkAbstractArray as a property map of vtkVariants</span>
<a name="l00114"></a>00114 <span class="keyword">template</span><>
<a name="l00115"></a><a class="code" href="a00056.html">00115</a> <span class="keyword">struct </span>property_traits<<a class="code" href="a00081.html" title="Abstract superclass for all arrays.">vtkAbstractArray</a>*>
<a name="l00116"></a>00116 {
<a name="l00117"></a><a class="code" href="a00056.html#a85f94c73e55329c61735a134b80d12d">00117</a> <span class="keyword">typedef</span> <a class="code" href="a01810.html" title="A atomic type representing the union of many types.">vtkVariant</a> <a class="code" href="a01810.html" title="A atomic type representing the union of many types.">value_type</a>;
<a name="l00118"></a><a class="code" href="a00056.html#08f68dd3c7da4da0d872359900cce576">00118</a> <span class="keyword">typedef</span> <a class="code" href="a01810.html" title="A atomic type representing the union of many types.">vtkVariant</a> <a class="code" href="a01810.html" title="A atomic type representing the union of many types.">reference</a>;
<a name="l00119"></a><a class="code" href="a00056.html#f21e04d81f432cb08785e7f2c6e062b9">00119</a> <span class="keyword">typedef</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> key_type;
<a name="l00120"></a><a class="code" href="a00056.html#22bf1bb6def7335a95cd10a19fc16c78">00120</a> <span class="keyword">typedef</span> read_write_property_map_tag category;
<a name="l00121"></a>00121 };
<a name="l00122"></a>00122
<a name="l00123"></a>00123 <span class="keyword">inline</span> <a class="code" href="a01810.html" title="A atomic type representing the union of many types.">vtkVariant</a>
<a name="l00124"></a><a class="code" href="a03753.html#23544d87f92eaf1c88c3cdc2620d3c63">00124</a> <span class="keyword">get</span>(<a class="code" href="a00081.html" title="Abstract superclass for all arrays.">vtkAbstractArray</a> * <span class="keyword">const</span>& arr, <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>)
<a name="l00125"></a>00125 {
<a name="l00126"></a>00126 <span class="keywordflow">return</span> arr->GetVariantValue(<a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>);
<a name="l00127"></a>00127 }
<a name="l00128"></a>00128
<a name="l00129"></a>00129 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00130"></a><a class="code" href="a03753.html#d03ffd74a10730cb71453120cc3b6f2a">00130</a> <a class="code" href="a03753.html#e0ff0b306e9b57cced90d018255a704f">put</a>(<a class="code" href="a00081.html" title="Abstract superclass for all arrays.">vtkAbstractArray</a> *arr, <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>, <span class="keyword">const</span> <a class="code" href="a01810.html" title="A atomic type representing the union of many types.">vtkVariant</a>& <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2106bf5e5151797630e91167caab3f22b9a">value</a>)
<a name="l00131"></a>00131 {
<a name="l00132"></a>00132 arr-><a class="code" href="a00081.html#e42ba2dd175602d25c7b2754facd262b">InsertVariantValue</a>(key, value);
<a name="l00133"></a>00133 }
<a name="l00134"></a>00134 }
<a name="l00135"></a>00135
<a name="l00136"></a>00136 <span class="preprocessor">#include <vtksys/stl/utility></span>
<a name="l00137"></a>00137
<a name="l00138"></a>00138 <span class="preprocessor">#include <boost/config.hpp></span>
<a name="l00139"></a>00139 <span class="preprocessor">#include <boost/iterator/iterator_facade.hpp></span>
<a name="l00140"></a>00140 <span class="preprocessor">#include <boost/graph/graph_traits.hpp></span>
<a name="l00141"></a>00141 <span class="preprocessor">#include <boost/graph/properties.hpp></span>
<a name="l00142"></a>00142 <span class="preprocessor">#include <boost/graph/adjacency_iterator.hpp></span>
<a name="l00143"></a>00143
<a name="l00144"></a>00144 <span class="comment">// The functions and classes in this file allows the user to</span>
<a name="l00145"></a>00145 <span class="comment">// treat a vtkDirectedGraph or vtkUndirectedGraph object </span>
<a name="l00146"></a>00146 <span class="comment">// as a boost graph "as is".</span>
<a name="l00147"></a>00147
<a name="l00148"></a>00148 <span class="keyword">namespace </span>boost {
<a name="l00149"></a>00149
<a name="l00150"></a><a class="code" href="a00080.html">00150</a> <span class="keyword">class </span><a class="code" href="a00080.html">vtk_vertex_iterator</a> :
<a name="l00151"></a>00151 <span class="keyword">public</span> iterator_facade<vtk_vertex_iterator,
<a name="l00152"></a>00152 vtkIdType,
<a name="l00153"></a>00153 bidirectional_traversal_tag,
<a name="l00154"></a>00154 vtkIdType,
<a name="l00155"></a>00155 vtkIdType>
<a name="l00156"></a>00156 {
<a name="l00157"></a>00157 <span class="keyword">public</span>:
<a name="l00158"></a><a class="code" href="a00080.html#cadf13d92e5665ab6307c1b144fc0b85">00158</a> <span class="keyword">explicit</span> <a class="code" href="a00080.html#cadf13d92e5665ab6307c1b144fc0b85">vtk_vertex_iterator</a>(<a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> i = 0) : index(i) {}
<a name="l00159"></a>00159
<a name="l00160"></a>00160 <span class="keyword">private</span>:
<a name="l00161"></a>00161 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> dereference()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> index; }
<a name="l00162"></a>00162
<a name="l00163"></a>00163 <span class="keywordtype">bool</span> equal(<span class="keyword">const</span> <a class="code" href="a00080.html#cadf13d92e5665ab6307c1b144fc0b85">vtk_vertex_iterator</a>& other)<span class="keyword"> const</span>
<a name="l00164"></a>00164 <span class="keyword"> </span>{ <span class="keywordflow">return</span> index == other.index; }
<a name="l00165"></a>00165
<a name="l00166"></a>00166 <span class="keywordtype">void</span> increment() { index++; }
<a name="l00167"></a>00167 <span class="keywordtype">void</span> decrement() { index--; }
<a name="l00168"></a>00168
<a name="l00169"></a>00169 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> index;
<a name="l00170"></a>00170
<a name="l00171"></a><a class="code" href="a00080.html#0975271623c74c5b89bdf8d7fbce69c4">00171</a> <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00080.html#0975271623c74c5b89bdf8d7fbce69c4">iterator_core_access</a>;
<a name="l00172"></a>00172 };
<a name="l00173"></a>00173
<a name="l00174"></a><a class="code" href="a00077.html">00174</a> <span class="keyword">class </span><a class="code" href="a00077.html">vtk_edge_iterator</a> :
<a name="l00175"></a>00175 <span class="keyword">public</span> iterator_facade<vtk_edge_iterator,
<a name="l00176"></a>00176 vtkEdgeType,
<a name="l00177"></a>00177 forward_traversal_tag,
<a name="l00178"></a>00178 vtkEdgeType,
<a name="l00179"></a>00179 vtkIdType>
<a name="l00180"></a>00180 {
<a name="l00181"></a>00181 <span class="keyword">public</span>:
<a name="l00182"></a><a class="code" href="a00077.html#18b17dd67994b6141baef2d554e3efe0">00182</a> <span class="keyword">explicit</span> <a class="code" href="a00077.html#18b17dd67994b6141baef2d554e3efe0">vtk_edge_iterator</a>(<a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> *g = 0, <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v = 0) :
<a name="l00183"></a>00183 directed(false), vertex(v), lastVertex(v), iter(0), end(0), graph(g)
<a name="l00184"></a>00184 {
<a name="l00185"></a>00185 <span class="keywordflow">if</span> (graph)
<a name="l00186"></a>00186 {
<a name="l00187"></a>00187 lastVertex = graph-><a class="code" href="a00654.html#1acbb7b69387ec2a08956d1d9d11c679">GetNumberOfVertices</a>();
<a name="l00188"></a>00188 }
<a name="l00189"></a>00189
<a name="l00190"></a>00190 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> myRank = -1;
<a name="l00191"></a>00191 <a class="code" href="a00433.html" title="helper for the vtkGraph class that allows the graph to be distributed across multiple...">vtkDistributedGraphHelper</a> *helper
<a name="l00192"></a>00192 = this->graph? this->graph-><a class="code" href="a00654.html#09924a04ae4c4d22d621b65f237e6f22">GetDistributedGraphHelper</a>() : 0;
<a name="l00193"></a>00193 <span class="keywordflow">if</span> (helper)
<a name="l00194"></a>00194 {
<a name="l00195"></a>00195 myRank = this->graph-><a class="code" href="a00362.html#cdfda34e33725ee93cebf3da57d35248">GetInformation</a>()-><a class="code" href="a00872.html#15261e52394732eb23b42dd2f213b4f5">Get</a>(<a class="code" href="a00362.html#7464dd2b3744df438882d961fddc941f">vtkDataObject::DATA_PIECE_NUMBER</a>());
<a name="l00196"></a>00196 vertex = helper-><a class="code" href="a00433.html#1aa236e2ac760b9e2d72157889609e38">MakeDistributedId</a>(myRank, vertex);
<a name="l00197"></a>00197 lastVertex = helper-><a class="code" href="a00433.html#1aa236e2ac760b9e2d72157889609e38">MakeDistributedId</a>(myRank, lastVertex);
<a name="l00198"></a>00198 }
<a name="l00199"></a>00199
<a name="l00200"></a>00200 <span class="keywordflow">if</span> (graph != 0)
<a name="l00201"></a>00201 {
<a name="l00202"></a>00202 directed = (<a class="code" href="a00421.html#1c8bf0c2b604d50756ae73f9a75f5c76">vtkDirectedGraph::SafeDownCast</a>(graph) != 0);
<a name="l00203"></a>00203 <span class="keywordflow">while</span> (vertex < lastVertex && this->graph-><a class="code" href="a00654.html#0475d284ef47ef037c22bff52293e202">GetOutDegree</a>(vertex) == 0)
<a name="l00204"></a>00204 {
<a name="l00205"></a>00205 ++vertex;
<a name="l00206"></a>00206 }
<a name="l00207"></a>00207
<a name="l00208"></a>00208 <span class="keywordflow">if</span> (vertex < lastVertex)
<a name="l00209"></a>00209 {
<a name="l00210"></a>00210 <span class="comment">// Get the outgoing edges of the first vertex that has outgoing</span>
<a name="l00211"></a>00211 <span class="comment">// edges</span>
<a name="l00212"></a>00212 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> nedges;
<a name="l00213"></a>00213 graph-><a class="code" href="a00654.html#a9e590baa974a7fc0f601c8c7383fd3f">GetOutEdges</a>(vertex, iter, nedges);
<a name="l00214"></a>00214 end = iter + nedges;
<a name="l00215"></a>00215
<a name="l00216"></a>00216 <span class="keywordflow">if</span> (!directed)
<a name="l00217"></a>00217 {
<a name="l00218"></a>00218 <span class="keywordflow">while</span>(iter != 0
<a name="l00219"></a>00219 && (<span class="comment">// Skip non-local edges</span>
<a name="l00220"></a>00220 (helper && helper-><a class="code" href="a00433.html#be66bdbdc86211d6f4570c11dc77a137">GetEdgeOwner</a>(iter-><a class="code" href="a00445.html#b9cdbfa89c9102a760031e7d9249628b">Id</a>) != myRank)
<a name="l00221"></a>00221 <span class="comment">// Skip entirely-local edges where Source > Target</span>
<a name="l00222"></a>00222 || (((helper
<a name="l00223"></a>00223 && myRank == helper-><a class="code" href="a00433.html#3b19f0f0109bb7506a1b407b7d5faa0e">GetVertexOwner</a>(iter-><a class="code" href="a01138.html#10a4f65d5c7e0e608ba122759885fa10">Target</a>))
<a name="l00224"></a>00224 || !helper)
<a name="l00225"></a>00225 && vertex > iter-><a class="code" href="a01138.html#10a4f65d5c7e0e608ba122759885fa10">Target</a>)))
<a name="l00226"></a>00226 {
<a name="l00227"></a>00227 this->inc();
<a name="l00228"></a>00228 }
<a name="l00229"></a>00229 }
<a name="l00230"></a>00230 }
<a name="l00231"></a>00231 <span class="keywordflow">else</span>
<a name="l00232"></a>00232 {
<a name="l00233"></a>00233 iter = 0;
<a name="l00234"></a>00234 }
<a name="l00235"></a>00235 }
<a name="l00236"></a>00236 }
<a name="l00237"></a>00237
<a name="l00238"></a>00238 <span class="keyword">private</span>:
<a name="l00239"></a>00239 <a class="code" href="a00454.html">vtkEdgeType</a> dereference()<span class="keyword"> const</span>
<a name="l00240"></a>00240 <span class="keyword"> </span>{ <span class="keywordflow">return</span> <a class="code" href="a00454.html">vtkEdgeType</a>(vertex, iter-><a class="code" href="a01138.html#10a4f65d5c7e0e608ba122759885fa10">Target</a>, iter-><a class="code" href="a00445.html#b9cdbfa89c9102a760031e7d9249628b">Id</a>); }
<a name="l00241"></a>00241
<a name="l00242"></a>00242 <span class="keywordtype">bool</span> equal(<span class="keyword">const</span> <a class="code" href="a00077.html#18b17dd67994b6141baef2d554e3efe0">vtk_edge_iterator</a>& other)<span class="keyword"> const</span>
<a name="l00243"></a>00243 <span class="keyword"> </span>{ <span class="keywordflow">return</span> vertex == other.vertex && iter == other.iter; }
<a name="l00244"></a>00244
<a name="l00245"></a>00245 <span class="keywordtype">void</span> increment()
<a name="l00246"></a>00246 {
<a name="l00247"></a>00247 inc();
<a name="l00248"></a>00248 <span class="keywordflow">if</span> (!directed)
<a name="l00249"></a>00249 {
<a name="l00250"></a>00250 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> myRank = -1;
<a name="l00251"></a>00251 <a class="code" href="a00433.html" title="helper for the vtkGraph class that allows the graph to be distributed across multiple...">vtkDistributedGraphHelper</a> *helper
<a name="l00252"></a>00252 = this->graph? this->graph-><a class="code" href="a00654.html#09924a04ae4c4d22d621b65f237e6f22">GetDistributedGraphHelper</a>() : 0;
<a name="l00253"></a>00253 <span class="keywordflow">if</span> (helper)
<a name="l00254"></a>00254 {
<a name="l00255"></a>00255 myRank = this->graph-><a class="code" href="a00362.html#cdfda34e33725ee93cebf3da57d35248">GetInformation</a>()-><a class="code" href="a00872.html#15261e52394732eb23b42dd2f213b4f5">Get</a>(<a class="code" href="a00362.html#7464dd2b3744df438882d961fddc941f">vtkDataObject::DATA_PIECE_NUMBER</a>());
<a name="l00256"></a>00256 }
<a name="l00257"></a>00257
<a name="l00258"></a>00258 <span class="keywordflow">while</span> (iter != 0
<a name="l00259"></a>00259 && (<span class="comment">// Skip non-local edges</span>
<a name="l00260"></a>00260 (helper && helper-><a class="code" href="a00433.html#be66bdbdc86211d6f4570c11dc77a137">GetEdgeOwner</a>(iter-><a class="code" href="a00445.html#b9cdbfa89c9102a760031e7d9249628b">Id</a>) != myRank)
<a name="l00261"></a>00261 <span class="comment">// Skip entirely-local edges where Source > Target</span>
<a name="l00262"></a>00262 || (((helper
<a name="l00263"></a>00263 && myRank == helper-><a class="code" href="a00433.html#3b19f0f0109bb7506a1b407b7d5faa0e">GetVertexOwner</a>(iter-><a class="code" href="a01138.html#10a4f65d5c7e0e608ba122759885fa10">Target</a>))
<a name="l00264"></a>00264 || !helper)
<a name="l00265"></a>00265 && vertex > iter-><a class="code" href="a01138.html#10a4f65d5c7e0e608ba122759885fa10">Target</a>)))
<a name="l00266"></a>00266 {
<a name="l00267"></a>00267 inc();
<a name="l00268"></a>00268 }
<a name="l00269"></a>00269 }
<a name="l00270"></a>00270 }
<a name="l00271"></a>00271
<a name="l00272"></a>00272 <span class="keywordtype">void</span> inc()
<a name="l00273"></a>00273 {
<a name="l00274"></a>00274 ++iter;
<a name="l00275"></a>00275 <span class="keywordflow">if</span> (iter == end)
<a name="l00276"></a>00276 {
<a name="l00277"></a>00277 <span class="comment">// Find a vertex with nonzero out degree.</span>
<a name="l00278"></a>00278 ++vertex;
<a name="l00279"></a>00279 <span class="keywordflow">while</span> (vertex < lastVertex && this->graph-><a class="code" href="a00654.html#0475d284ef47ef037c22bff52293e202">GetOutDegree</a>(vertex) == 0)
<a name="l00280"></a>00280 {
<a name="l00281"></a>00281 ++vertex;
<a name="l00282"></a>00282 }
<a name="l00283"></a>00283
<a name="l00284"></a>00284 <span class="keywordflow">if</span> (vertex < lastVertex)
<a name="l00285"></a>00285 {
<a name="l00286"></a>00286 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> nedges;
<a name="l00287"></a>00287 graph-><a class="code" href="a00654.html#a9e590baa974a7fc0f601c8c7383fd3f">GetOutEdges</a>(vertex, iter, nedges);
<a name="l00288"></a>00288 end = iter + nedges;
<a name="l00289"></a>00289 }
<a name="l00290"></a>00290 <span class="keywordflow">else</span>
<a name="l00291"></a>00291 {
<a name="l00292"></a>00292 iter = 0;
<a name="l00293"></a>00293 }
<a name="l00294"></a>00294 }
<a name="l00295"></a>00295 }
<a name="l00296"></a>00296
<a name="l00297"></a>00297 <span class="keywordtype">bool</span> directed;
<a name="l00298"></a>00298 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vertex;
<a name="l00299"></a>00299 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> lastVertex;
<a name="l00300"></a>00300 <span class="keyword">const</span> <a class="code" href="a01138.html">vtkOutEdgeType</a> * iter;
<a name="l00301"></a>00301 <span class="keyword">const</span> <a class="code" href="a01138.html">vtkOutEdgeType</a> * end;
<a name="l00302"></a>00302 <a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> *graph;
<a name="l00303"></a>00303
<a name="l00304"></a><a class="code" href="a00077.html#0975271623c74c5b89bdf8d7fbce69c4">00304</a> <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00077.html#0975271623c74c5b89bdf8d7fbce69c4">iterator_core_access</a>;
<a name="l00305"></a>00305 };
<a name="l00306"></a>00306
<a name="l00307"></a><a class="code" href="a00079.html">00307</a> <span class="keyword">class </span><a class="code" href="a00079.html">vtk_out_edge_pointer_iterator</a> :
<a name="l00308"></a>00308 <span class="keyword">public</span> iterator_facade<vtk_out_edge_pointer_iterator,
<a name="l00309"></a>00309 vtkEdgeType,
<a name="l00310"></a>00310 bidirectional_traversal_tag,
<a name="l00311"></a>00311 vtkEdgeType,
<a name="l00312"></a>00312 ptrdiff_t>
<a name="l00313"></a>00313 {
<a name="l00314"></a>00314 <span class="keyword">public</span>:
<a name="l00315"></a><a class="code" href="a00079.html#085136e7555577ad9090a71d8754277b">00315</a> <span class="keyword">explicit</span> <a class="code" href="a00079.html#085136e7555577ad9090a71d8754277b">vtk_out_edge_pointer_iterator</a>(<a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> *g = 0, <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v = 0, <span class="keywordtype">bool</span> end = <span class="keyword">false</span>) :
<a name="l00316"></a>00316 vertex(v)
<a name="l00317"></a>00317 {
<a name="l00318"></a>00318 <span class="keywordflow">if</span> (g)
<a name="l00319"></a>00319 {
<a name="l00320"></a>00320 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> nedges;
<a name="l00321"></a>00321 g->GetOutEdges(vertex, iter, nedges);
<a name="l00322"></a>00322 <span class="keywordflow">if</span> (end)
<a name="l00323"></a>00323 {
<a name="l00324"></a>00324 iter += nedges;
<a name="l00325"></a>00325 }
<a name="l00326"></a>00326 }
<a name="l00327"></a>00327 }
<a name="l00328"></a>00328
<a name="l00329"></a>00329 <span class="keyword">private</span>:
<a name="l00330"></a>00330 <a class="code" href="a00454.html">vtkEdgeType</a> dereference()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="a00454.html">vtkEdgeType</a>(vertex, iter-><a class="code" href="a01138.html#10a4f65d5c7e0e608ba122759885fa10">Target</a>, iter-><a class="code" href="a00445.html#b9cdbfa89c9102a760031e7d9249628b">Id</a>); }
<a name="l00331"></a>00331
<a name="l00332"></a>00332 <span class="keywordtype">bool</span> equal(<span class="keyword">const</span> <a class="code" href="a00079.html#085136e7555577ad9090a71d8754277b">vtk_out_edge_pointer_iterator</a>& other)<span class="keyword"> const</span>
<a name="l00333"></a>00333 <span class="keyword"> </span>{ <span class="keywordflow">return</span> iter == other.iter; }
<a name="l00334"></a>00334
<a name="l00335"></a>00335 <span class="keywordtype">void</span> increment() { iter++; }
<a name="l00336"></a>00336 <span class="keywordtype">void</span> decrement() { iter--; }
<a name="l00337"></a>00337
<a name="l00338"></a>00338 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vertex;
<a name="l00339"></a>00339 <span class="keyword">const</span> <a class="code" href="a01138.html">vtkOutEdgeType</a> *iter;
<a name="l00340"></a>00340
<a name="l00341"></a><a class="code" href="a00079.html#0975271623c74c5b89bdf8d7fbce69c4">00341</a> <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00079.html#0975271623c74c5b89bdf8d7fbce69c4">iterator_core_access</a>;
<a name="l00342"></a>00342 };
<a name="l00343"></a>00343
<a name="l00344"></a><a class="code" href="a00078.html">00344</a> <span class="keyword">class </span><a class="code" href="a00078.html">vtk_in_edge_pointer_iterator</a> :
<a name="l00345"></a>00345 <span class="keyword">public</span> iterator_facade<vtk_in_edge_pointer_iterator,
<a name="l00346"></a>00346 vtkEdgeType,
<a name="l00347"></a>00347 bidirectional_traversal_tag,
<a name="l00348"></a>00348 vtkEdgeType,
<a name="l00349"></a>00349 ptrdiff_t>
<a name="l00350"></a>00350 {
<a name="l00351"></a>00351 <span class="keyword">public</span>:
<a name="l00352"></a><a class="code" href="a00078.html#5ea216997ac177dd5597548987b64c44">00352</a> <span class="keyword">explicit</span> <a class="code" href="a00078.html#5ea216997ac177dd5597548987b64c44">vtk_in_edge_pointer_iterator</a>(<a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> *g = 0, <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v = 0, <span class="keywordtype">bool</span> end = <span class="keyword">false</span>) :
<a name="l00353"></a>00353 vertex(v)
<a name="l00354"></a>00354 {
<a name="l00355"></a>00355 <span class="keywordflow">if</span> (g)
<a name="l00356"></a>00356 {
<a name="l00357"></a>00357 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> nedges;
<a name="l00358"></a>00358 g->GetInEdges(vertex, iter, nedges);
<a name="l00359"></a>00359 <span class="keywordflow">if</span> (end)
<a name="l00360"></a>00360 {
<a name="l00361"></a>00361 iter += nedges;
<a name="l00362"></a>00362 }
<a name="l00363"></a>00363 }
<a name="l00364"></a>00364 }
<a name="l00365"></a>00365
<a name="l00366"></a>00366 <span class="keyword">private</span>:
<a name="l00367"></a>00367 <a class="code" href="a00454.html">vtkEdgeType</a> dereference()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="a00454.html">vtkEdgeType</a>(iter-><a class="code" href="a00871.html#14a351832ab534211fb58f1ef79f2073">Source</a>, vertex, iter-><a class="code" href="a00445.html#b9cdbfa89c9102a760031e7d9249628b">Id</a>); }
<a name="l00368"></a>00368
<a name="l00369"></a>00369 <span class="keywordtype">bool</span> equal(<span class="keyword">const</span> <a class="code" href="a00078.html#5ea216997ac177dd5597548987b64c44">vtk_in_edge_pointer_iterator</a>& other)<span class="keyword"> const</span>
<a name="l00370"></a>00370 <span class="keyword"> </span>{ <span class="keywordflow">return</span> iter == other.iter; }
<a name="l00371"></a>00371
<a name="l00372"></a>00372 <span class="keywordtype">void</span> increment() { iter++; }
<a name="l00373"></a>00373 <span class="keywordtype">void</span> decrement() { iter--; }
<a name="l00374"></a>00374
<a name="l00375"></a>00375 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vertex;
<a name="l00376"></a>00376 <span class="keyword">const</span> <a class="code" href="a00871.html">vtkInEdgeType</a> *iter;
<a name="l00377"></a>00377
<a name="l00378"></a><a class="code" href="a00078.html#0975271623c74c5b89bdf8d7fbce69c4">00378</a> <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00078.html#0975271623c74c5b89bdf8d7fbce69c4">iterator_core_access</a>;
<a name="l00379"></a>00379 };
<a name="l00380"></a>00380
<a name="l00381"></a>00381 <span class="comment">//===========================================================================</span>
<a name="l00382"></a>00382 <span class="comment">// vtkGraph</span>
<a name="l00383"></a>00383 <span class="comment">// VertexAndEdgeListGraphConcept</span>
<a name="l00384"></a>00384 <span class="comment">// BidirectionalGraphConcept</span>
<a name="l00385"></a>00385 <span class="comment">// AdjacencyGraphConcept</span>
<a name="l00386"></a>00386
<a name="l00387"></a><a class="code" href="a00655.html">00387</a> <span class="keyword">struct </span><a class="code" href="a00655.html">vtkGraph_traversal_category</a> :
<a name="l00388"></a>00388 <span class="keyword">public</span> <span class="keyword">virtual</span> bidirectional_graph_tag,
<a name="l00389"></a>00389 <span class="keyword">public</span> <span class="keyword">virtual</span> edge_list_graph_tag,
<a name="l00390"></a>00390 <span class="keyword">public</span> <span class="keyword">virtual</span> vertex_list_graph_tag,
<a name="l00391"></a>00391 <span class="keyword">public</span> <span class="keyword">virtual</span> adjacency_graph_tag { };
<a name="l00392"></a>00392
<a name="l00393"></a>00393 <span class="keyword">template</span> <>
<a name="l00394"></a><a class="code" href="a00020.html">00394</a> <span class="keyword">struct </span>graph_traits<<a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a>*> {
<a name="l00395"></a><a class="code" href="a00020.html#4d8caaf71d8f0184f5742d67415b74b6">00395</a> <span class="keyword">typedef</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vertex_descriptor;
<a name="l00396"></a><a class="code" href="a00020.html#6d14e6384e1da8e0c512824207b503b3">00396</a> <span class="keyword">static</span> vertex_descriptor null_vertex() { <span class="keywordflow">return</span> -1; }
<a name="l00397"></a><a class="code" href="a00020.html#b1604415245d6a882ddd210cb7a9d985">00397</a> <span class="keyword">typedef</span> <a class="code" href="a00454.html">vtkEdgeType</a> <a class="code" href="a00454.html">edge_descriptor</a>;
<a name="l00398"></a><a class="code" href="a00020.html#defea13668342cd5aeaaeeae4563932b">00398</a> <span class="keyword">static</span> edge_descriptor null_edge() { <span class="keywordflow">return</span> <a class="code" href="a00454.html">vtkEdgeType</a>(-1, -1, -1); }
<a name="l00399"></a><a class="code" href="a00020.html#648d7a069b7fea2b18d06c7f829dfb79">00399</a> <span class="keyword">typedef</span> <a class="code" href="a00079.html">vtk_out_edge_pointer_iterator</a> <a class="code" href="a00079.html">out_edge_iterator</a>;
<a name="l00400"></a><a class="code" href="a00020.html#0addce0f787134e2945f60215de7f634">00400</a> <span class="keyword">typedef</span> <a class="code" href="a00078.html">vtk_in_edge_pointer_iterator</a> <a class="code" href="a00078.html">in_edge_iterator</a>;
<a name="l00401"></a>00401
<a name="l00402"></a><a class="code" href="a00020.html#569b94c3dae314dd66832bec4cdb0269">00402</a> <span class="keyword">typedef</span> <a class="code" href="a00080.html">vtk_vertex_iterator</a> <a class="code" href="a00080.html">vertex_iterator</a>;
<a name="l00403"></a><a class="code" href="a00020.html#dd7a0064c1ade76de6e79cf62be8d2bf">00403</a> <span class="keyword">typedef</span> <a class="code" href="a00077.html">vtk_edge_iterator</a> <a class="code" href="a00077.html">edge_iterator</a>;
<a name="l00404"></a>00404
<a name="l00405"></a><a class="code" href="a00020.html#2ebe8fecc0cf3beb6f6af548c35d1448">00405</a> <span class="keyword">typedef</span> allow_parallel_edge_tag edge_parallel_category;
<a name="l00406"></a><a class="code" href="a00020.html#b05996ca596a490d42e0ca76b16664f3">00406</a> <span class="keyword">typedef</span> <a class="code" href="a00655.html">vtkGraph_traversal_category</a> <a class="code" href="a00655.html">traversal_category</a>;
<a name="l00407"></a><a class="code" href="a00020.html#80bbf7d443fd0b661ae38315d9016c0e">00407</a> <span class="keyword">typedef</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vertices_size_type;
<a name="l00408"></a><a class="code" href="a00020.html#1c7992429f6a26c9741f7559a8f2ba9b">00408</a> <span class="keyword">typedef</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> edges_size_type;
<a name="l00409"></a><a class="code" href="a00020.html#d0e4ce3ca56df3887215c076c5cfee79">00409</a> <span class="keyword">typedef</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> degree_size_type;
<a name="l00410"></a>00410
<a name="l00411"></a>00411 <span class="keyword">typedef</span> adjacency_iterator_generator<<a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a>*,
<a name="l00412"></a><a class="code" href="a00020.html#7f394121a9efea10ec9776bf26c8a5d1">00412</a> vertex_descriptor, out_edge_iterator><a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2108e7f81709ed57920a45c02a954726847">::type</a> adjacency_iterator;
<a name="l00413"></a>00413 };
<a name="l00414"></a>00414
<a name="l00415"></a>00415 <span class="keyword">template</span><>
<a name="l00416"></a><a class="code" href="a00067.html">00416</a> <span class="keyword">struct </span>vertex_property_type< <a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a>* > {
<a name="l00417"></a><a class="code" href="a00067.html#2e84ca3520fc9099ec2831a4be9139b8">00417</a> <span class="keyword">typedef</span> no_property <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2108e7f81709ed57920a45c02a954726847">type</a>;
<a name="l00418"></a>00418 };
<a name="l00419"></a>00419
<a name="l00420"></a>00420 <span class="keyword">template</span><>
<a name="l00421"></a><a class="code" href="a00005.html">00421</a> <span class="keyword">struct </span>edge_property_type< <a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a>* > {
<a name="l00422"></a><a class="code" href="a00005.html#8832ac6e78b17ba8b934dfd2f1447dc2">00422</a> <span class="keyword">typedef</span> no_property <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2108e7f81709ed57920a45c02a954726847">type</a>;
<a name="l00423"></a>00423 };
<a name="l00424"></a>00424
<a name="l00425"></a>00425 <span class="comment">//===========================================================================</span>
<a name="l00426"></a>00426 <span class="comment">// vtkDirectedGraph</span>
<a name="l00427"></a>00427
<a name="l00428"></a>00428 <span class="keyword">template</span> <>
<a name="l00429"></a><a class="code" href="a00018.html">00429</a> <span class="keyword">struct </span>graph_traits<<a class="code" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a>*> : graph_traits<vtkGraph*>
<a name="l00430"></a>00430 {
<a name="l00431"></a><a class="code" href="a00018.html#b00642f515824813f49a18ea1f5a01dc">00431</a> <span class="keyword">typedef</span> directed_tag directed_category;
<a name="l00432"></a>00432 };
<a name="l00433"></a>00433
<a name="l00434"></a>00434 <span class="comment">// The graph_traits for a const graph are the same as a non-const graph.</span>
<a name="l00435"></a>00435 <span class="keyword">template</span> <>
<a name="l00436"></a><a class="code" href="a00013.html">00436</a> <span class="keyword">struct </span>graph_traits<const <a class="code" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a>*> : graph_traits<vtkDirectedGraph*> { };
<a name="l00437"></a>00437
<a name="l00438"></a>00438 <span class="comment">// The graph_traits for a const graph are the same as a non-const graph.</span>
<a name="l00439"></a>00439 <span class="keyword">template</span> <>
<a name="l00440"></a><a class="code" href="a00019.html">00440</a> <span class="keyword">struct </span>graph_traits<<a class="code" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a>* <span class="keyword">const</span>> : graph_traits<vtkDirectedGraph*> { };
<a name="l00441"></a>00441
<a name="l00442"></a>00442 <span class="comment">// Internal vertex properties</span>
<a name="l00443"></a>00443 <span class="keyword">template</span><>
<a name="l00444"></a><a class="code" href="a00065.html">00444</a> <span class="keyword">struct </span>vertex_property_type< <a class="code" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a>* >
<a name="l00445"></a>00445 : vertex_property_type< vtkGraph* > { };
<a name="l00446"></a>00446
<a name="l00447"></a>00447 <span class="comment">// Internal vertex properties</span>
<a name="l00448"></a>00448 <span class="keyword">template</span><>
<a name="l00449"></a><a class="code" href="a00066.html">00449</a> <span class="keyword">struct </span>vertex_property_type< <a class="code" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a>* <span class="keyword">const</span> >
<a name="l00450"></a>00450 : vertex_property_type< vtkGraph* > { };
<a name="l00451"></a>00451
<a name="l00452"></a>00452 <span class="comment">// Internal edge properties</span>
<a name="l00453"></a>00453 <span class="keyword">template</span><>
<a name="l00454"></a><a class="code" href="a00003.html">00454</a> <span class="keyword">struct </span>edge_property_type< <a class="code" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a>* >
<a name="l00455"></a>00455 : edge_property_type< vtkGraph* > { };
<a name="l00456"></a>00456
<a name="l00457"></a>00457 <span class="comment">// Internal edge properties</span>
<a name="l00458"></a>00458 <span class="keyword">template</span><>
<a name="l00459"></a><a class="code" href="a00004.html">00459</a> <span class="keyword">struct </span>edge_property_type< <a class="code" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a>* <span class="keyword">const</span> >
<a name="l00460"></a>00460 : edge_property_type< vtkGraph* > { };
<a name="l00461"></a>00461
<a name="l00462"></a>00462 <span class="comment">//===========================================================================</span>
<a name="l00463"></a>00463 <span class="comment">// vtkTree</span>
<a name="l00464"></a>00464
<a name="l00465"></a>00465 <span class="keyword">template</span> <>
<a name="l00466"></a><a class="code" href="a00025.html">00466</a> <span class="keyword">struct </span>graph_traits<<a class="code" href="a01741.html" title="A rooted tree data structure.">vtkTree</a>*> : graph_traits<vtkDirectedGraph*> { };
<a name="l00467"></a>00467
<a name="l00468"></a>00468 <span class="comment">// The graph_traits for a const graph are the same as a non-const graph.</span>
<a name="l00469"></a>00469 <span class="keyword">template</span> <>
<a name="l00470"></a><a class="code" href="a00016.html">00470</a> <span class="keyword">struct </span>graph_traits<const <a class="code" href="a01741.html" title="A rooted tree data structure.">vtkTree</a>*> : graph_traits<vtkTree*> { };
<a name="l00471"></a>00471
<a name="l00472"></a>00472 <span class="comment">// The graph_traits for a const graph are the same as a non-const graph.</span>
<a name="l00473"></a>00473 <span class="keyword">template</span> <>
<a name="l00474"></a><a class="code" href="a00026.html">00474</a> <span class="keyword">struct </span>graph_traits<<a class="code" href="a01741.html" title="A rooted tree data structure.">vtkTree</a>* <span class="keyword">const</span>> : graph_traits<vtkTree*> { };
<a name="l00475"></a>00475
<a name="l00476"></a>00476 <span class="comment">//===========================================================================</span>
<a name="l00477"></a>00477 <span class="comment">// vtkUndirectedGraph</span>
<a name="l00478"></a>00478 <span class="keyword">template</span> <>
<a name="l00479"></a><a class="code" href="a00027.html">00479</a> <span class="keyword">struct </span>graph_traits<<a class="code" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a>*> : graph_traits<vtkGraph*>
<a name="l00480"></a>00480 {
<a name="l00481"></a><a class="code" href="a00027.html#72051467cf7d096ed0ba0ee79ea973a7">00481</a> <span class="keyword">typedef</span> undirected_tag directed_category;
<a name="l00482"></a>00482 };
<a name="l00483"></a>00483
<a name="l00484"></a>00484 <span class="comment">// The graph_traits for a const graph are the same as a non-const graph.</span>
<a name="l00485"></a>00485 <span class="keyword">template</span> <>
<a name="l00486"></a><a class="code" href="a00017.html">00486</a> <span class="keyword">struct </span>graph_traits<const <a class="code" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a>*> : graph_traits<vtkUndirectedGraph*> { };
<a name="l00487"></a>00487
<a name="l00488"></a>00488 <span class="comment">// The graph_traits for a const graph are the same as a non-const graph.</span>
<a name="l00489"></a>00489 <span class="keyword">template</span> <>
<a name="l00490"></a><a class="code" href="a00028.html">00490</a> <span class="keyword">struct </span>graph_traits<<a class="code" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a>* <span class="keyword">const</span>> : graph_traits<vtkUndirectedGraph*> { };
<a name="l00491"></a>00491
<a name="l00492"></a>00492 <span class="comment">// Internal vertex properties</span>
<a name="l00493"></a>00493 <span class="keyword">template</span><>
<a name="l00494"></a><a class="code" href="a00072.html">00494</a> <span class="keyword">struct </span>vertex_property_type< <a class="code" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a>* >
<a name="l00495"></a>00495 : vertex_property_type< vtkGraph* > { };
<a name="l00496"></a>00496
<a name="l00497"></a>00497 <span class="comment">// Internal vertex properties</span>
<a name="l00498"></a>00498 <span class="keyword">template</span><>
<a name="l00499"></a><a class="code" href="a00073.html">00499</a> <span class="keyword">struct </span>vertex_property_type< <a class="code" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a>* <span class="keyword">const</span> >
<a name="l00500"></a>00500 : vertex_property_type< vtkGraph* > { };
<a name="l00501"></a>00501
<a name="l00502"></a>00502 <span class="comment">// Internal edge properties</span>
<a name="l00503"></a>00503 <span class="keyword">template</span><>
<a name="l00504"></a><a class="code" href="a00010.html">00504</a> <span class="keyword">struct </span>edge_property_type< <a class="code" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a>* >
<a name="l00505"></a>00505 : edge_property_type< vtkGraph* > { };
<a name="l00506"></a>00506
<a name="l00507"></a>00507 <span class="comment">// Internal edge properties</span>
<a name="l00508"></a>00508 <span class="keyword">template</span><>
<a name="l00509"></a><a class="code" href="a00011.html">00509</a> <span class="keyword">struct </span>edge_property_type< <a class="code" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a>* <span class="keyword">const</span> >
<a name="l00510"></a>00510 : edge_property_type< vtkGraph* > { };
<a name="l00511"></a>00511
<a name="l00512"></a>00512 <span class="comment">//===========================================================================</span>
<a name="l00513"></a>00513 <span class="comment">// vtkMutableDirectedGraph</span>
<a name="l00514"></a>00514
<a name="l00515"></a>00515 <span class="keyword">template</span> <>
<a name="l00516"></a><a class="code" href="a00021.html">00516</a> <span class="keyword">struct </span>graph_traits<<a class="code" href="a01071.html" title="An editable directed graph.">vtkMutableDirectedGraph</a>*> : graph_traits<vtkDirectedGraph*> { };
<a name="l00517"></a>00517
<a name="l00518"></a>00518 <span class="comment">// The graph_traits for a const graph are the same as a non-const graph.</span>
<a name="l00519"></a>00519 <span class="keyword">template</span> <>
<a name="l00520"></a><a class="code" href="a00014.html">00520</a> <span class="keyword">struct </span>graph_traits<const <a class="code" href="a01071.html" title="An editable directed graph.">vtkMutableDirectedGraph</a>*> : graph_traits<vtkMutableDirectedGraph*> { };
<a name="l00521"></a>00521
<a name="l00522"></a>00522 <span class="comment">// The graph_traits for a const graph are the same as a non-const graph.</span>
<a name="l00523"></a>00523 <span class="keyword">template</span> <>
<a name="l00524"></a><a class="code" href="a00022.html">00524</a> <span class="keyword">struct </span>graph_traits<<a class="code" href="a01071.html" title="An editable directed graph.">vtkMutableDirectedGraph</a>* <span class="keyword">const</span>> : graph_traits<vtkMutableDirectedGraph*> { };
<a name="l00525"></a>00525
<a name="l00526"></a>00526 <span class="comment">// Internal vertex properties</span>
<a name="l00527"></a>00527 <span class="keyword">template</span><>
<a name="l00528"></a><a class="code" href="a00068.html">00528</a> <span class="keyword">struct </span>vertex_property_type< <a class="code" href="a01071.html" title="An editable directed graph.">vtkMutableDirectedGraph</a>* >
<a name="l00529"></a>00529 : vertex_property_type< vtkDirectedGraph* > { };
<a name="l00530"></a>00530
<a name="l00531"></a>00531 <span class="comment">// Internal vertex properties</span>
<a name="l00532"></a>00532 <span class="keyword">template</span><>
<a name="l00533"></a><a class="code" href="a00069.html">00533</a> <span class="keyword">struct </span>vertex_property_type< <a class="code" href="a01071.html" title="An editable directed graph.">vtkMutableDirectedGraph</a>* <span class="keyword">const</span> >
<a name="l00534"></a>00534 : vertex_property_type< vtkDirectedGraph* > { };
<a name="l00535"></a>00535
<a name="l00536"></a>00536 <span class="comment">// Internal edge properties</span>
<a name="l00537"></a>00537 <span class="keyword">template</span><>
<a name="l00538"></a><a class="code" href="a00006.html">00538</a> <span class="keyword">struct </span>edge_property_type< <a class="code" href="a01071.html" title="An editable directed graph.">vtkMutableDirectedGraph</a>* >
<a name="l00539"></a>00539 : edge_property_type< vtkDirectedGraph* > { };
<a name="l00540"></a>00540
<a name="l00541"></a>00541 <span class="comment">// Internal edge properties</span>
<a name="l00542"></a>00542 <span class="keyword">template</span><>
<a name="l00543"></a><a class="code" href="a00007.html">00543</a> <span class="keyword">struct </span>edge_property_type< <a class="code" href="a01071.html" title="An editable directed graph.">vtkMutableDirectedGraph</a>* <span class="keyword">const</span> >
<a name="l00544"></a>00544 : edge_property_type< vtkDirectedGraph* > { };
<a name="l00545"></a>00545
<a name="l00546"></a>00546 <span class="comment">//===========================================================================</span>
<a name="l00547"></a>00547 <span class="comment">// vtkMutableUndirectedGraph</span>
<a name="l00548"></a>00548
<a name="l00549"></a>00549 <span class="keyword">template</span> <>
<a name="l00550"></a><a class="code" href="a00023.html">00550</a> <span class="keyword">struct </span>graph_traits<<a class="code" href="a01073.html" title="An editable undirected graph.">vtkMutableUndirectedGraph</a>*> : graph_traits<vtkUndirectedGraph*> { };
<a name="l00551"></a>00551
<a name="l00552"></a>00552 <span class="comment">// The graph_traits for a const graph are the same as a non-const graph.</span>
<a name="l00553"></a>00553 <span class="keyword">template</span> <>
<a name="l00554"></a><a class="code" href="a00015.html">00554</a> <span class="keyword">struct </span>graph_traits<const <a class="code" href="a01073.html" title="An editable undirected graph.">vtkMutableUndirectedGraph</a>*> : graph_traits<vtkMutableUndirectedGraph*> { };
<a name="l00555"></a>00555
<a name="l00556"></a>00556 <span class="comment">// The graph_traits for a const graph are the same as a non-const graph.</span>
<a name="l00557"></a>00557 <span class="keyword">template</span> <>
<a name="l00558"></a><a class="code" href="a00024.html">00558</a> <span class="keyword">struct </span>graph_traits<<a class="code" href="a01073.html" title="An editable undirected graph.">vtkMutableUndirectedGraph</a>* <span class="keyword">const</span>> : graph_traits<vtkMutableUndirectedGraph*> { };
<a name="l00559"></a>00559
<a name="l00560"></a>00560 <span class="comment">// Internal vertex properties</span>
<a name="l00561"></a>00561 <span class="keyword">template</span><>
<a name="l00562"></a><a class="code" href="a00070.html">00562</a> <span class="keyword">struct </span>vertex_property_type< <a class="code" href="a01073.html" title="An editable undirected graph.">vtkMutableUndirectedGraph</a>* >
<a name="l00563"></a>00563 : vertex_property_type< vtkUndirectedGraph* > { };
<a name="l00564"></a>00564
<a name="l00565"></a>00565 <span class="comment">// Internal vertex properties</span>
<a name="l00566"></a>00566 <span class="keyword">template</span><>
<a name="l00567"></a><a class="code" href="a00071.html">00567</a> <span class="keyword">struct </span>vertex_property_type< <a class="code" href="a01073.html" title="An editable undirected graph.">vtkMutableUndirectedGraph</a>* <span class="keyword">const</span> >
<a name="l00568"></a>00568 : vertex_property_type< vtkUndirectedGraph* > { };
<a name="l00569"></a>00569
<a name="l00570"></a>00570 <span class="comment">// Internal edge properties</span>
<a name="l00571"></a>00571 <span class="keyword">template</span><>
<a name="l00572"></a><a class="code" href="a00008.html">00572</a> <span class="keyword">struct </span>edge_property_type< <a class="code" href="a01073.html" title="An editable undirected graph.">vtkMutableUndirectedGraph</a>* >
<a name="l00573"></a>00573 : edge_property_type< vtkUndirectedGraph* > { };
<a name="l00574"></a>00574
<a name="l00575"></a>00575 <span class="comment">// Internal edge properties</span>
<a name="l00576"></a>00576 <span class="keyword">template</span><>
<a name="l00577"></a><a class="code" href="a00009.html">00577</a> <span class="keyword">struct </span>edge_property_type< <a class="code" href="a01073.html" title="An editable undirected graph.">vtkMutableUndirectedGraph</a>* <span class="keyword">const</span> >
<a name="l00578"></a>00578 : edge_property_type< vtkUndirectedGraph* > { };
<a name="l00579"></a>00579
<a name="l00580"></a>00580 <span class="comment">//===========================================================================</span>
<a name="l00581"></a>00581 <span class="comment">// API implementation</span>
<a name="l00582"></a>00582 <span class="keyword">template</span> <>
<a name="l00583"></a><a class="code" href="a00064.html">00583</a> <span class="keyword">class </span>vertex_property< <a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a>* > {
<a name="l00584"></a>00584 <span class="keyword">public</span>:
<a name="l00585"></a><a class="code" href="a00064.html#bff3283425d0a9cfdcb3ad1699d738c9">00585</a> <span class="keyword">typedef</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2108e7f81709ed57920a45c02a954726847">type</a>;
<a name="l00586"></a>00586 };
<a name="l00587"></a>00587
<a name="l00588"></a>00588 <span class="keyword">template</span> <>
<a name="l00589"></a><a class="code" href="a00002.html">00589</a> <span class="keyword">class </span>edge_property< <a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a>* > {
<a name="l00590"></a>00590 <span class="keyword">public</span>:
<a name="l00591"></a><a class="code" href="a00002.html#ee430747ae9a93e673405b4b76d755c7">00591</a> <span class="keyword">typedef</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2108e7f81709ed57920a45c02a954726847">type</a>;
<a name="l00592"></a>00592 };
<a name="l00593"></a>00593 } <span class="comment">// end namespace boost</span>
<a name="l00594"></a>00594
<a name="l00595"></a>00595 <span class="keyword">inline</span> <a class="code" href="a00020.html#4d8caaf71d8f0184f5742d67415b74b6">boost::graph_traits< vtkGraph* >::vertex_descriptor</a>
<a name="l00596"></a><a class="code" href="a02995.html#7c22aa18a4e42c330618a6410d133551">00596</a> <a class="code" href="a02995.html#7c22aa18a4e42c330618a6410d133551">source</a>(<a class="code" href="a00020.html#b1604415245d6a882ddd210cb7a9d985">boost::graph_traits< vtkGraph* >::edge_descriptor</a> e,
<a name="l00597"></a>00597 <a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> *)
<a name="l00598"></a>00598 {
<a name="l00599"></a>00599 <span class="keywordflow">return</span> e.Source;
<a name="l00600"></a>00600 }
<a name="l00601"></a>00601
<a name="l00602"></a>00602 <span class="keyword">inline</span> <a class="code" href="a00020.html#4d8caaf71d8f0184f5742d67415b74b6">boost::graph_traits< vtkGraph* >::vertex_descriptor</a>
<a name="l00603"></a><a class="code" href="a02995.html#fc938df20cbcc0144ed508333af97623">00603</a> <a class="code" href="a02995.html#fc938df20cbcc0144ed508333af97623">target</a>(<a class="code" href="a00020.html#b1604415245d6a882ddd210cb7a9d985">boost::graph_traits< vtkGraph* >::edge_descriptor</a> e,
<a name="l00604"></a>00604 <a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> *)
<a name="l00605"></a>00605 {
<a name="l00606"></a>00606 <span class="keywordflow">return</span> e.Target;
<a name="l00607"></a>00607 }
<a name="l00608"></a>00608
<a name="l00609"></a>00609 <span class="keyword">inline</span> vtksys_stl::pair<
<a name="l00610"></a>00610 <a class="code" href="a00020.html#569b94c3dae314dd66832bec4cdb0269">boost::graph_traits< vtkGraph* >::vertex_iterator</a>,
<a name="l00611"></a>00611 boost::graph_traits< vtkGraph* >::vertex_iterator >
<a name="l00612"></a><a class="code" href="a02995.html#f72f6dd7eacdaa16475e07e0331750a2">00612</a> <a class="code" href="a02995.html#f72f6dd7eacdaa16475e07e0331750a2">vertices</a>(<a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> *g)
<a name="l00613"></a>00613 {
<a name="l00614"></a>00614 <span class="keyword">typedef</span> boost::graph_traits< vtkGraph* >::vertex_iterator Iter;
<a name="l00615"></a>00615 <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> start = 0;
<a name="l00616"></a>00616 <span class="keywordflow">if</span> (<a class="code" href="a00433.html" title="helper for the vtkGraph class that allows the graph to be distributed across multiple...">vtkDistributedGraphHelper</a> *helper = g-><a class="code" href="a00654.html#09924a04ae4c4d22d621b65f237e6f22">GetDistributedGraphHelper</a>())
<a name="l00617"></a>00617 {
<a name="l00618"></a>00618 <span class="keywordtype">int</span> rank =
<a name="l00619"></a>00619 g-><a class="code" href="a00362.html#cdfda34e33725ee93cebf3da57d35248">GetInformation</a>()-><a class="code" href="a00872.html#15261e52394732eb23b42dd2f213b4f5">Get</a>(<a class="code" href="a00362.html#7464dd2b3744df438882d961fddc941f">vtkDataObject::DATA_PIECE_NUMBER</a>());
<a name="l00620"></a>00620 start = helper-><a class="code" href="a00433.html#1aa236e2ac760b9e2d72157889609e38">MakeDistributedId</a>(rank, start);
<a name="l00621"></a>00621 }
<a name="l00622"></a>00622
<a name="l00623"></a>00623 <span class="keywordflow">return</span> vtksys_stl::make_pair( Iter(start),
<a name="l00624"></a>00624 Iter(start + g-><a class="code" href="a00654.html#1acbb7b69387ec2a08956d1d9d11c679">GetNumberOfVertices</a>()) );
<a name="l00625"></a>00625 }
<a name="l00626"></a>00626
<a name="l00627"></a>00627 <span class="keyword">inline</span> vtksys_stl::pair<
<a name="l00628"></a>00628 <a class="code" href="a00020.html#dd7a0064c1ade76de6e79cf62be8d2bf">boost::graph_traits< vtkGraph* >::edge_iterator</a>,
<a name="l00629"></a>00629 boost::graph_traits< vtkGraph* >::edge_iterator >
<a name="l00630"></a><a class="code" href="a02995.html#f2e7c5aa065ddd4bd73c80382b944f78">00630</a> <a class="code" href="a02995.html#f2e7c5aa065ddd4bd73c80382b944f78">edges</a>(<a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> *g)
<a name="l00631"></a>00631 {
<a name="l00632"></a>00632 <span class="keyword">typedef</span> boost::graph_traits< vtkGraph* >::edge_iterator Iter;
<a name="l00633"></a>00633 <span class="keywordflow">return</span> vtksys_stl::make_pair( Iter(g), Iter(g, g-><a class="code" href="a00654.html#1acbb7b69387ec2a08956d1d9d11c679">GetNumberOfVertices</a>()) );
<a name="l00634"></a>00634 }
<a name="l00635"></a>00635
<a name="l00636"></a>00636 <span class="keyword">inline</span> vtksys_stl::pair<
<a name="l00637"></a>00637 <a class="code" href="a00020.html#648d7a069b7fea2b18d06c7f829dfb79">boost::graph_traits< vtkGraph* >::out_edge_iterator</a>,
<a name="l00638"></a>00638 boost::graph_traits< vtkGraph* >::out_edge_iterator >
<a name="l00639"></a><a class="code" href="a02995.html#1db51fd1a569aa178e4bad4be0875fc6">00639</a> <a class="code" href="a02995.html#1db51fd1a569aa178e4bad4be0875fc6">out_edges</a>(
<a name="l00640"></a>00640 <a class="code" href="a00020.html#4d8caaf71d8f0184f5742d67415b74b6">boost::graph_traits< vtkGraph* >::vertex_descriptor</a> u,
<a name="l00641"></a>00641 <a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> *g)
<a name="l00642"></a>00642 {
<a name="l00643"></a>00643 <span class="keyword">typedef</span> boost::graph_traits< vtkGraph* >::out_edge_iterator Iter;
<a name="l00644"></a>00644 vtksys_stl::pair<Iter, Iter> p = vtksys_stl::make_pair( Iter(g, u), Iter(g, u, <span class="keyword">true</span>) );
<a name="l00645"></a>00645 <span class="keywordflow">return</span> p;
<a name="l00646"></a>00646 }
<a name="l00647"></a>00647
<a name="l00648"></a>00648 <span class="keyword">inline</span> vtksys_stl::pair<
<a name="l00649"></a>00649 <a class="code" href="a00020.html#0addce0f787134e2945f60215de7f634">boost::graph_traits< vtkGraph* >::in_edge_iterator</a>,
<a name="l00650"></a>00650 boost::graph_traits< vtkGraph* >::in_edge_iterator >
<a name="l00651"></a><a class="code" href="a02995.html#8f480d7a9c92489aeea2e7f7a5872f09">00651</a> <a class="code" href="a02995.html#8f480d7a9c92489aeea2e7f7a5872f09">in_edges</a>(
<a name="l00652"></a>00652 <a class="code" href="a00020.html#4d8caaf71d8f0184f5742d67415b74b6">boost::graph_traits< vtkGraph* >::vertex_descriptor</a> u,
<a name="l00653"></a>00653 <a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> *g)
<a name="l00654"></a>00654 {
<a name="l00655"></a>00655 <span class="keyword">typedef</span> boost::graph_traits< vtkGraph* >::in_edge_iterator Iter;
<a name="l00656"></a>00656 vtksys_stl::pair<Iter, Iter> p = vtksys_stl::make_pair( Iter(g, u), Iter(g, u, <span class="keyword">true</span>) );
<a name="l00657"></a>00657 <span class="keywordflow">return</span> p;
<a name="l00658"></a>00658 }
<a name="l00659"></a>00659
<a name="l00660"></a>00660 <span class="keyword">inline</span> vtksys_stl::pair<
<a name="l00661"></a>00661 <a class="code" href="a00020.html#7f394121a9efea10ec9776bf26c8a5d1">boost::graph_traits< vtkGraph* >::adjacency_iterator</a>,
<a name="l00662"></a>00662 boost::graph_traits< vtkGraph* >::adjacency_iterator >
<a name="l00663"></a><a class="code" href="a02995.html#4023f5ea73d3294c92f56ef45d80afb4">00663</a> <a class="code" href="a02995.html#4023f5ea73d3294c92f56ef45d80afb4">adjacent_vertices</a>(
<a name="l00664"></a>00664 <a class="code" href="a00020.html#4d8caaf71d8f0184f5742d67415b74b6">boost::graph_traits< vtkGraph* >::vertex_descriptor</a> u,
<a name="l00665"></a>00665 <a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> *g)
<a name="l00666"></a>00666 {
<a name="l00667"></a>00667 <span class="keyword">typedef</span> boost::graph_traits< vtkGraph* >::adjacency_iterator Iter;
<a name="l00668"></a>00668 <span class="keyword">typedef</span> boost::graph_traits< vtkGraph* >::out_edge_iterator OutEdgeIter;
<a name="l00669"></a>00669 vtksys_stl::pair<OutEdgeIter, OutEdgeIter> out = <a class="code" href="a02995.html#1db51fd1a569aa178e4bad4be0875fc6">out_edges</a>(u, g);
<a name="l00670"></a>00670 <span class="keywordflow">return</span> vtksys_stl::make_pair( Iter(out.first, &g), Iter(out.second, &g) );
<a name="l00671"></a>00671 }
<a name="l00672"></a>00672
<a name="l00673"></a>00673 <span class="keyword">inline</span> <a class="code" href="a00020.html#80bbf7d443fd0b661ae38315d9016c0e">boost::graph_traits< vtkGraph* >::vertices_size_type</a>
<a name="l00674"></a><a class="code" href="a02995.html#2d5d6254701286cf960b026d392ac3bd">00674</a> <a class="code" href="a02995.html#2d5d6254701286cf960b026d392ac3bd">num_vertices</a>(<a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> *g)
<a name="l00675"></a>00675 {
<a name="l00676"></a>00676 <span class="keywordflow">return</span> g-><a class="code" href="a00654.html#1acbb7b69387ec2a08956d1d9d11c679">GetNumberOfVertices</a>();
<a name="l00677"></a>00677 }
<a name="l00678"></a>00678
<a name="l00679"></a>00679 <span class="keyword">inline</span> <a class="code" href="a00020.html#1c7992429f6a26c9741f7559a8f2ba9b">boost::graph_traits< vtkGraph* >::edges_size_type</a>
<a name="l00680"></a><a class="code" href="a02995.html#fdf58078575bbb388bc8bc54502e2600">00680</a> <a class="code" href="a02995.html#fdf58078575bbb388bc8bc54502e2600">num_edges</a>(<a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> *g)
<a name="l00681"></a>00681 {
<a name="l00682"></a>00682 <span class="keywordflow">return</span> g-><a class="code" href="a00654.html#c3534f310838e2303919825f0ec436ff">GetNumberOfEdges</a>();
<a name="l00683"></a>00683 }
<a name="l00684"></a>00684
<a name="l00685"></a>00685 <span class="keyword">inline</span> <a class="code" href="a00020.html#d0e4ce3ca56df3887215c076c5cfee79">boost::graph_traits< vtkGraph* >::degree_size_type</a>
<a name="l00686"></a><a class="code" href="a02995.html#e51547d2c81665c1e9aa609724af86d7">00686</a> <a class="code" href="a02995.html#e51547d2c81665c1e9aa609724af86d7">out_degree</a>(
<a name="l00687"></a>00687 <a class="code" href="a00020.html#4d8caaf71d8f0184f5742d67415b74b6">boost::graph_traits< vtkGraph* >::vertex_descriptor</a> u,
<a name="l00688"></a>00688 <a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> *g)
<a name="l00689"></a>00689 {
<a name="l00690"></a>00690 <span class="keywordflow">return</span> g-><a class="code" href="a00654.html#0475d284ef47ef037c22bff52293e202">GetOutDegree</a>(u);
<a name="l00691"></a>00691 }
<a name="l00692"></a>00692
<a name="l00693"></a>00693 <span class="keyword">inline</span> <a class="code" href="a00020.html#d0e4ce3ca56df3887215c076c5cfee79">boost::graph_traits< vtkDirectedGraph* >::degree_size_type</a>
<a name="l00694"></a><a class="code" href="a02995.html#6e166d40761fc42443f82a6b1709d85b">00694</a> <a class="code" href="a02995.html#6e166d40761fc42443f82a6b1709d85b">in_degree</a>(
<a name="l00695"></a>00695 <a class="code" href="a00020.html#4d8caaf71d8f0184f5742d67415b74b6">boost::graph_traits< vtkDirectedGraph* >::vertex_descriptor</a> u,
<a name="l00696"></a>00696 <a class="code" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a> *g)
<a name="l00697"></a>00697 {
<a name="l00698"></a>00698 <span class="keywordflow">return</span> g-><a class="code" href="a00654.html#d57b421461510206123401cbe49eea49">GetInDegree</a>(u);
<a name="l00699"></a>00699 }
<a name="l00700"></a>00700
<a name="l00701"></a>00701 <span class="keyword">inline</span> <a class="code" href="a00020.html#d0e4ce3ca56df3887215c076c5cfee79">boost::graph_traits< vtkGraph* >::degree_size_type</a>
<a name="l00702"></a><a class="code" href="a02995.html#9449cb0cb31e69a2a8f9612f2f192cd6">00702</a> <a class="code" href="a02995.html#9449cb0cb31e69a2a8f9612f2f192cd6">degree</a>(
<a name="l00703"></a>00703 <a class="code" href="a00020.html#4d8caaf71d8f0184f5742d67415b74b6">boost::graph_traits< vtkGraph* >::vertex_descriptor</a> u,
<a name="l00704"></a>00704 <a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> *g)
<a name="l00705"></a>00705 {
<a name="l00706"></a>00706 <span class="keywordflow">return</span> g-><a class="code" href="a00654.html#ef5ab35e5db0684677108c2bb692ed03">GetDegree</a>(u);
<a name="l00707"></a>00707 }
<a name="l00708"></a>00708
<a name="l00709"></a>00709 <span class="keyword">inline</span> <a class="code" href="a00020.html#4d8caaf71d8f0184f5742d67415b74b6">boost::graph_traits< vtkMutableDirectedGraph* >::vertex_descriptor</a>
<a name="l00710"></a><a class="code" href="a02995.html#fa7a95ca38e45e8b885d0b5644492169">00710</a> <a class="code" href="a02995.html#fa7a95ca38e45e8b885d0b5644492169">add_vertex</a>(<a class="code" href="a01071.html" title="An editable directed graph.">vtkMutableDirectedGraph</a> *g)
<a name="l00711"></a>00711 {
<a name="l00712"></a>00712 <span class="keywordflow">return</span> g-><a class="code" href="a01071.html#8ad0283b88e496ef6dcdbbef48dc2a6e">AddVertex</a>();
<a name="l00713"></a>00713 }
<a name="l00714"></a>00714
<a name="l00715"></a>00715 <span class="keyword">inline</span> vtksys_stl::pair<
<a name="l00716"></a>00716 <a class="code" href="a00020.html#b1604415245d6a882ddd210cb7a9d985">boost::graph_traits< vtkMutableDirectedGraph* >::edge_descriptor</a>,
<a name="l00717"></a>00717 <span class="keywordtype">bool</span>>
<a name="l00718"></a><a class="code" href="a02995.html#23bd9a2edf75d62af15f7ebabaf2de1d">00718</a> <a class="code" href="a02995.html#23bd9a2edf75d62af15f7ebabaf2de1d">add_edge</a>(
<a name="l00719"></a>00719 <a class="code" href="a00020.html#4d8caaf71d8f0184f5742d67415b74b6">boost::graph_traits< vtkMutableDirectedGraph* >::vertex_descriptor</a> u,
<a name="l00720"></a>00720 <a class="code" href="a00020.html#4d8caaf71d8f0184f5742d67415b74b6">boost::graph_traits< vtkMutableDirectedGraph* >::vertex_descriptor</a> v,
<a name="l00721"></a>00721 <a class="code" href="a01071.html" title="An editable directed graph.">vtkMutableDirectedGraph</a> *g)
<a name="l00722"></a>00722 {
<a name="l00723"></a>00723 boost::graph_traits< vtkMutableDirectedGraph* >::edge_descriptor e = g-><a class="code" href="a01071.html#d803df3fa45d52ac3a1bf05d057cf7d1">AddEdge</a>(u, v);
<a name="l00724"></a>00724 <span class="keywordflow">return</span> vtksys_stl::make_pair(e, <span class="keyword">true</span>);
<a name="l00725"></a>00725 }
<a name="l00726"></a>00726
<a name="l00727"></a>00727 <span class="keyword">inline</span> <a class="code" href="a00020.html#4d8caaf71d8f0184f5742d67415b74b6">boost::graph_traits< vtkMutableUndirectedGraph* >::vertex_descriptor</a>
<a name="l00728"></a><a class="code" href="a02995.html#a7dfc473bdbc35d90ccfce06fec94267">00728</a> <a class="code" href="a02995.html#fa7a95ca38e45e8b885d0b5644492169">add_vertex</a>(<a class="code" href="a01073.html" title="An editable undirected graph.">vtkMutableUndirectedGraph</a> *g)
<a name="l00729"></a>00729 {
<a name="l00730"></a>00730 <span class="keywordflow">return</span> g-><a class="code" href="a01073.html#de4e0c5b3ecd5988353e9c4901c100a2">AddVertex</a>();
<a name="l00731"></a>00731 }
<a name="l00732"></a>00732
<a name="l00733"></a>00733 <span class="keyword">inline</span> vtksys_stl::pair<
<a name="l00734"></a>00734 <a class="code" href="a00020.html#b1604415245d6a882ddd210cb7a9d985">boost::graph_traits< vtkMutableUndirectedGraph* >::edge_descriptor</a>,
<a name="l00735"></a>00735 <span class="keywordtype">bool</span>>
<a name="l00736"></a><a class="code" href="a02995.html#72680eb646da2eb79406830774262e8f">00736</a> <a class="code" href="a02995.html#23bd9a2edf75d62af15f7ebabaf2de1d">add_edge</a>(
<a name="l00737"></a>00737 <a class="code" href="a00020.html#4d8caaf71d8f0184f5742d67415b74b6">boost::graph_traits< vtkMutableUndirectedGraph* >::vertex_descriptor</a> u,
<a name="l00738"></a>00738 <a class="code" href="a00020.html#4d8caaf71d8f0184f5742d67415b74b6">boost::graph_traits< vtkMutableUndirectedGraph* >::vertex_descriptor</a> v,
<a name="l00739"></a>00739 <a class="code" href="a01073.html" title="An editable undirected graph.">vtkMutableUndirectedGraph</a> *g)
<a name="l00740"></a>00740 {
<a name="l00741"></a>00741 boost::graph_traits< vtkMutableUndirectedGraph* >::edge_descriptor e = g-><a class="code" href="a01073.html#e3282124d33aa997c3540f7de83f1ea3">AddEdge</a>(u, v);
<a name="l00742"></a>00742 <span class="keywordflow">return</span> vtksys_stl::make_pair(e, <span class="keyword">true</span>);
<a name="l00743"></a>00743 }
<a name="l00744"></a>00744
<a name="l00745"></a>00745 <span class="keyword">namespace </span>boost {
<a name="l00746"></a>00746 <span class="comment">//===========================================================================</span>
<a name="l00747"></a>00747 <span class="comment">// An edge map for vtkGraph.</span>
<a name="l00748"></a>00748 <span class="comment">// This is a common input needed for algorithms.</span>
<a name="l00749"></a>00749
<a name="l00750"></a><a class="code" href="a00658.html">00750</a> <span class="keyword">struct </span><a class="code" href="a00658.html">vtkGraphEdgeMap</a> { };
<a name="l00751"></a>00751
<a name="l00752"></a>00752 <span class="keyword">template</span> <>
<a name="l00753"></a><a class="code" href="a00059.html">00753</a> <span class="keyword">struct </span>property_traits<<a class="code" href="a00658.html">vtkGraphEdgeMap</a>>
<a name="l00754"></a>00754 {
<a name="l00755"></a><a class="code" href="a00059.html#fccec4615be01bd85ddffafec887128c">00755</a> <span class="keyword">typedef</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> value_type;
<a name="l00756"></a><a class="code" href="a00059.html#25f4a35fb1142cb55aaf5fc0ec8dd5ff">00756</a> <span class="keyword">typedef</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d21007cdaec72795b9d958f3051ff223566a">reference</a>;
<a name="l00757"></a><a class="code" href="a00059.html#3b33c4fe4991e92473a3202455945632">00757</a> <span class="keyword">typedef</span> <a class="code" href="a00454.html">vtkEdgeType</a> <a class="code" href="a00454.html">key_type</a>;
<a name="l00758"></a><a class="code" href="a00059.html#db0f26406a90663505501ff1e221ee6e">00758</a> <span class="keyword">typedef</span> readable_property_map_tag category;
<a name="l00759"></a>00759 };
<a name="l00760"></a>00760
<a name="l00761"></a>00761 <span class="keyword">inline</span> <a class="code" href="a00059.html#25f4a35fb1142cb55aaf5fc0ec8dd5ff">property_traits<vtkGraphEdgeMap>::reference</a>
<a name="l00762"></a><a class="code" href="a03753.html#221b741298cfb4fb248db74ffd2925ce">00762</a> <span class="keyword">get</span>(
<a name="l00763"></a>00763 <a class="code" href="a00658.html">vtkGraphEdgeMap</a> vtkNotUsed(arr),
<a name="l00764"></a>00764 <a class="code" href="a00059.html#3b33c4fe4991e92473a3202455945632">property_traits<vtkGraphEdgeMap>::key_type</a> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>)
<a name="l00765"></a>00765 {
<a name="l00766"></a>00766 <span class="keywordflow">return</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>.Id;
<a name="l00767"></a>00767 }
<a name="l00768"></a>00768
<a name="l00769"></a>00769 <span class="comment">//===========================================================================</span>
<a name="l00770"></a>00770 <span class="comment">// Helper for vtkGraph edge property maps</span>
<a name="l00771"></a>00771 <span class="comment">// Automatically converts boost edge ids to vtkGraph edge ids.</span>
<a name="l00772"></a>00772
<a name="l00773"></a>00773 <span class="keyword">template</span><<span class="keyword">typename</span> PMap>
<a name="l00774"></a><a class="code" href="a00659.html">00774</a> <span class="keyword">class </span><a class="code" href="a00659.html">vtkGraphEdgePropertyMapHelper</a>
<a name="l00775"></a>00775 {
<a name="l00776"></a>00776 <span class="keyword">public</span>:
<a name="l00777"></a><a class="code" href="a00659.html#ceea49b22f09890698cdfcc0cd33eb1e">00777</a> <a class="code" href="a00659.html#ceea49b22f09890698cdfcc0cd33eb1e">vtkGraphEdgePropertyMapHelper</a>(PMap m) : <a class="code" href="a00659.html#d77da2d868cf5361124dd181d17727b0">pmap</a>(m) { }
<a name="l00778"></a><a class="code" href="a00659.html#d77da2d868cf5361124dd181d17727b0">00778</a> PMap <a class="code" href="a00659.html#d77da2d868cf5361124dd181d17727b0">pmap</a>;
<a name="l00779"></a><a class="code" href="a00659.html#a2c050883d4293a501b215204073565b">00779</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> property_traits<PMap>::value_type <a class="code" href="a00659.html#a2c050883d4293a501b215204073565b">value_type</a>;
<a name="l00780"></a><a class="code" href="a00659.html#343cf6b64f44fc138629888000e5077a">00780</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d21007cdaec72795b9d958f3051ff223566a">property_traits<PMap>::reference</a> <a class="code" href="a00659.html#343cf6b64f44fc138629888000e5077a">reference</a>;
<a name="l00781"></a><a class="code" href="a00659.html#81badb9118a07743f70e783f22551cb7">00781</a> <span class="keyword">typedef</span> <a class="code" href="a00454.html">vtkEdgeType</a> <a class="code" href="a00454.html">key_type</a>;
<a name="l00782"></a><a class="code" href="a00659.html#5db506653ea06716283ca7831c2c97c6">00782</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> property_traits<PMap>::category <a class="code" href="a00659.html#5db506653ea06716283ca7831c2c97c6">category</a>;
<a name="l00783"></a>00783 };
<a name="l00784"></a>00784
<a name="l00785"></a>00785 <span class="keyword">template</span><<span class="keyword">typename</span> PMap>
<a name="l00786"></a>00786 <span class="keyword">inline</span> <span class="keyword">typename</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d21007cdaec72795b9d958f3051ff223566a">property_traits<PMap>::reference</a>
<a name="l00787"></a><a class="code" href="a03753.html#dd25435b9abac8e3d391ffa1c3c70c34">00787</a> <span class="keyword">get</span>(
<a name="l00788"></a>00788 <a class="code" href="a00659.html">vtkGraphEdgePropertyMapHelper<PMap></a> helper,
<a name="l00789"></a>00789 <a class="code" href="a00454.html">vtkEdgeType</a> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>)
<a name="l00790"></a>00790 {
<a name="l00791"></a>00791 <span class="keywordflow">return</span> <span class="keyword">get</span>(helper.pmap, <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>.Id);
<a name="l00792"></a>00792 }
<a name="l00793"></a>00793
<a name="l00794"></a>00794 <span class="keyword">template</span><<span class="keyword">typename</span> PMap>
<a name="l00795"></a>00795 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00796"></a><a class="code" href="a03753.html#f70e1d89b6bcf3868fa8bfefc82aefc7">00796</a> <a class="code" href="a03753.html#e0ff0b306e9b57cced90d018255a704f">put</a>(
<a name="l00797"></a>00797 <a class="code" href="a00659.html">vtkGraphEdgePropertyMapHelper<PMap></a> helper,
<a name="l00798"></a>00798 <a class="code" href="a00454.html">vtkEdgeType</a> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>,
<a name="l00799"></a>00799 <span class="keyword">const</span> <span class="keyword">typename</span> property_traits<PMap>::value_type & <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2106bf5e5151797630e91167caab3f22b9a">value</a>)
<a name="l00800"></a>00800 {
<a name="l00801"></a>00801 <a class="code" href="a03753.html#e0ff0b306e9b57cced90d018255a704f">put</a>(helper.<a class="code" href="a00659.html#d77da2d868cf5361124dd181d17727b0">pmap</a>, key.<a class="code" href="a00445.html#b9cdbfa89c9102a760031e7d9249628b">Id</a>, value);
<a name="l00802"></a>00802 }
<a name="l00803"></a>00803
<a name="l00804"></a>00804 <span class="comment">//===========================================================================</span>
<a name="l00805"></a>00805 <span class="comment">// An index map for vtkGraph</span>
<a name="l00806"></a>00806 <span class="comment">// This is a common input needed for algorithms</span>
<a name="l00807"></a>00807
<a name="l00808"></a><a class="code" href="a00663.html">00808</a> <span class="keyword">struct </span><a class="code" href="a00663.html">vtkGraphIndexMap</a> { };
<a name="l00809"></a>00809
<a name="l00810"></a>00810 <span class="keyword">template</span> <>
<a name="l00811"></a><a class="code" href="a00060.html">00811</a> <span class="keyword">struct </span>property_traits<<a class="code" href="a00663.html">vtkGraphIndexMap</a>>
<a name="l00812"></a>00812 {
<a name="l00813"></a><a class="code" href="a00060.html#36efbebb12c7b78f2b6369373f5248ac">00813</a> <span class="keyword">typedef</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> value_type;
<a name="l00814"></a><a class="code" href="a00060.html#81fc05ac9b65bfc96411dd73564df9a0">00814</a> <span class="keyword">typedef</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d21007cdaec72795b9d958f3051ff223566a">reference</a>;
<a name="l00815"></a><a class="code" href="a00060.html#0f9f2c908574530fca46203b349c6f40">00815</a> <span class="keyword">typedef</span> <a class="code" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> key_type;
<a name="l00816"></a><a class="code" href="a00060.html#9cd3c3b8805eef2f4abaaacf97c6cb1d">00816</a> <span class="keyword">typedef</span> readable_property_map_tag category;
<a name="l00817"></a>00817 };
<a name="l00818"></a>00818
<a name="l00819"></a>00819 <span class="keyword">inline</span> <a class="code" href="a00060.html#81fc05ac9b65bfc96411dd73564df9a0">property_traits<vtkGraphIndexMap>::reference</a>
<a name="l00820"></a><a class="code" href="a03753.html#b5910b5811e8199f8d7eaad5796af0c4">00820</a> <span class="keyword">get</span>(
<a name="l00821"></a>00821 <a class="code" href="a00663.html">vtkGraphIndexMap</a> vtkNotUsed(arr),
<a name="l00822"></a>00822 <a class="code" href="a00060.html#0f9f2c908574530fca46203b349c6f40">property_traits<vtkGraphIndexMap>::key_type</a> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>)
<a name="l00823"></a>00823 {
<a name="l00824"></a>00824 <span class="keywordflow">return</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>;
<a name="l00825"></a>00825 }
<a name="l00826"></a>00826
<a name="l00827"></a>00827 <span class="comment">//===========================================================================</span>
<a name="l00828"></a>00828 <span class="comment">// Helper for vtkGraph property maps</span>
<a name="l00829"></a>00829 <span class="comment">// Automatically multiplies the property value by some value (default 1)</span>
<a name="l00830"></a>00830 <span class="keyword">template</span><<span class="keyword">typename</span> PMap>
<a name="l00831"></a><a class="code" href="a00670.html">00831</a> <span class="keyword">class </span><a class="code" href="a00670.html">vtkGraphPropertyMapMultiplier</a>
<a name="l00832"></a>00832 {
<a name="l00833"></a>00833 <span class="keyword">public</span>:
<a name="l00834"></a><a class="code" href="a00670.html#152800caebe7aef241ac379c0cc73865">00834</a> <a class="code" href="a00670.html#152800caebe7aef241ac379c0cc73865">vtkGraphPropertyMapMultiplier</a>(PMap m, <span class="keywordtype">float</span> multi=1) : <a class="code" href="a00670.html#96b1cfb56a829a73dded7d86e00d198f">pmap</a>(m),<a class="code" href="a00670.html#d1709a3c659b95a267ec5fd7ad80e73c">multiplier</a>(multi){}
<a name="l00835"></a><a class="code" href="a00670.html#96b1cfb56a829a73dded7d86e00d198f">00835</a> PMap <a class="code" href="a00670.html#96b1cfb56a829a73dded7d86e00d198f">pmap</a>;
<a name="l00836"></a><a class="code" href="a00670.html#d1709a3c659b95a267ec5fd7ad80e73c">00836</a> <span class="keywordtype">float</span> <a class="code" href="a00670.html#d1709a3c659b95a267ec5fd7ad80e73c">multiplier</a>;
<a name="l00837"></a><a class="code" href="a00670.html#2bcdcd059abe000fbae1b462a2c6d09b">00837</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> property_traits<PMap>::value_type <a class="code" href="a00670.html#2bcdcd059abe000fbae1b462a2c6d09b">value_type</a>;
<a name="l00838"></a><a class="code" href="a00670.html#3c11fdd8f7bfb43fe3c139759cae0d2e">00838</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d21007cdaec72795b9d958f3051ff223566a">property_traits<PMap>::reference</a> <a class="code" href="a00670.html#3c11fdd8f7bfb43fe3c139759cae0d2e">reference</a>;
<a name="l00839"></a><a class="code" href="a00670.html#75557ce827f77989c3512e38ff459701">00839</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> property_traits<PMap>::key_type <a class="code" href="a00670.html#75557ce827f77989c3512e38ff459701">key_type</a>;
<a name="l00840"></a><a class="code" href="a00670.html#a28cc9e0d47cc0375ec35f913459cc9c">00840</a> <span class="keyword">typedef</span> <span class="keyword">typename</span> property_traits<PMap>::category <a class="code" href="a00670.html#a28cc9e0d47cc0375ec35f913459cc9c">category</a>;
<a name="l00841"></a>00841 };
<a name="l00842"></a>00842
<a name="l00843"></a>00843 <span class="keyword">template</span><<span class="keyword">typename</span> PMap>
<a name="l00844"></a>00844 <span class="keyword">inline</span> <span class="keyword">typename</span> <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d21007cdaec72795b9d958f3051ff223566a">property_traits<PMap>::reference</a>
<a name="l00845"></a><a class="code" href="a03753.html#fd09caf2c709be60d15661958bb93b64">00845</a> <span class="keyword">get</span>(
<a name="l00846"></a>00846 <a class="code" href="a00670.html">vtkGraphPropertyMapMultiplier<PMap></a> multi,
<a name="l00847"></a>00847 <span class="keyword">const</span> <span class="keyword">typename</span> property_traits<PMap>::key_type <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>)
<a name="l00848"></a>00848 {
<a name="l00849"></a>00849 <span class="keywordflow">return</span> multi.multiplier * <span class="keyword">get</span>(multi.pmap, <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>);
<a name="l00850"></a>00850 }
<a name="l00851"></a>00851
<a name="l00852"></a>00852 <span class="keyword">template</span><<span class="keyword">typename</span> PMap>
<a name="l00853"></a>00853 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00854"></a><a class="code" href="a03753.html#d328580a76d99186b1bb9bd58380951a">00854</a> <a class="code" href="a03753.html#e0ff0b306e9b57cced90d018255a704f">put</a>(
<a name="l00855"></a>00855 <a class="code" href="a00670.html">vtkGraphPropertyMapMultiplier<PMap></a> multi,
<a name="l00856"></a>00856 <span class="keyword">const</span> <span class="keyword">typename</span> property_traits<PMap>::key_type <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2100846b78bc0416ae791ce3bc3eddc9bc7">key</a>,
<a name="l00857"></a>00857 <span class="keyword">const</span> <span class="keyword">typename</span> property_traits<PMap>::value_type & <a class="code" href="a03761.html#c6551f7bf833e8254b2b3ecdaea0d2106bf5e5151797630e91167caab3f22b9a">value</a>)
<a name="l00858"></a>00858 {
<a name="l00859"></a>00859 <a class="code" href="a03753.html#e0ff0b306e9b57cced90d018255a704f">put</a>(multi.<a class="code" href="a00670.html#96b1cfb56a829a73dded7d86e00d198f">pmap</a>, key, value);
<a name="l00860"></a>00860 }
<a name="l00861"></a>00861
<a name="l00862"></a>00862 <span class="comment">// Allow algorithms to automatically extract vtkGraphIndexMap from a</span>
<a name="l00863"></a>00863 <span class="comment">// VTK graph</span>
<a name="l00864"></a>00864 <span class="keyword">template</span><>
<a name="l00865"></a><a class="code" href="a00049.html">00865</a> <span class="keyword">struct </span>property_map<<a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a>*, vertex_index_t>
<a name="l00866"></a>00866 {
<a name="l00867"></a><a class="code" href="a00049.html#b70d608605fe249b5ee628a3239ac3ff">00867</a> <span class="keyword">typedef</span> <a class="code" href="a00663.html">vtkGraphIndexMap</a> <a class="code" href="a00663.html">type</a>;
<a name="l00868"></a><a class="code" href="a00049.html#daf06de495a77909dbd416ba8e086451">00868</a> <span class="keyword">typedef</span> <a class="code" href="a00663.html">vtkGraphIndexMap</a> <a class="code" href="a00663.html">const_type</a>;
<a name="l00869"></a>00869 };
<a name="l00870"></a>00870
<a name="l00871"></a>00871 <span class="keyword">template</span><>
<a name="l00872"></a><a class="code" href="a00043.html">00872</a> <span class="keyword">struct </span>property_map<<a class="code" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a>*, vertex_index_t>
<a name="l00873"></a>00873 : property_map<vtkGraph*, vertex_index_t> { };
<a name="l00874"></a>00874
<a name="l00875"></a>00875 <span class="keyword">template</span><>
<a name="l00876"></a><a class="code" href="a00053.html">00876</a> <span class="keyword">struct </span>property_map<<a class="code" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a>*, vertex_index_t>
<a name="l00877"></a>00877 : property_map<vtkGraph*, vertex_index_t> { };
<a name="l00878"></a>00878
<a name="l00879"></a><a class="code" href="a03753.html#06fe025f52ec49b330bdf0b174dd1b80">00879</a> <span class="keyword">inline</span> <a class="code" href="a00663.html">vtkGraphIndexMap</a> <span class="keyword">get</span>(vertex_index_t, <a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a>*) { <span class="keywordflow">return</span> <a class="code" href="a00663.html">vtkGraphIndexMap</a>(); }
<a name="l00880"></a>00880
<a name="l00881"></a>00881 <span class="keyword">template</span><>
<a name="l00882"></a><a class="code" href="a00047.html">00882</a> <span class="keyword">struct </span>property_map<<a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a>*, edge_index_t>
<a name="l00883"></a>00883 {
<a name="l00884"></a><a class="code" href="a00047.html#380c93d276cecc078a8401b52251cd94">00884</a> <span class="keyword">typedef</span> <a class="code" href="a00663.html">vtkGraphIndexMap</a> <a class="code" href="a00663.html">type</a>;
<a name="l00885"></a><a class="code" href="a00047.html#6a7ec12b997d6f8fdd61bcc2b843fc5c">00885</a> <span class="keyword">typedef</span> <a class="code" href="a00663.html">vtkGraphIndexMap</a> <a class="code" href="a00663.html">const_type</a>;
<a name="l00886"></a>00886 };
<a name="l00887"></a>00887
<a name="l00888"></a>00888 <span class="keyword">template</span><>
<a name="l00889"></a><a class="code" href="a00042.html">00889</a> <span class="keyword">struct </span>property_map<<a class="code" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a>*, edge_index_t>
<a name="l00890"></a>00890 : property_map<vtkGraph*, edge_index_t> { };
<a name="l00891"></a>00891
<a name="l00892"></a>00892 <span class="keyword">template</span><>
<a name="l00893"></a><a class="code" href="a00052.html">00893</a> <span class="keyword">struct </span>property_map<<a class="code" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a>*, edge_index_t>
<a name="l00894"></a>00894 : property_map<vtkGraph*, edge_index_t> { };
<a name="l00895"></a>00895
<a name="l00896"></a><a class="code" href="a03753.html#3c01aa7347709a9aef12c9b850bde486">00896</a> <span class="keyword">inline</span> <a class="code" href="a00663.html">vtkGraphIndexMap</a> <span class="keyword">get</span>(edge_index_t, <a class="code" href="a00654.html" title="Base class for graph data types.">vtkGraph</a>*) { <span class="keywordflow">return</span> <a class="code" href="a00663.html">vtkGraphIndexMap</a>(); }
<a name="l00897"></a>00897
<a name="l00898"></a>00898 <span class="comment">// property_map specializations for const-qualified graphs</span>
<a name="l00899"></a>00899 <span class="keyword">template</span><>
<a name="l00900"></a><a class="code" href="a00045.html">00900</a> <span class="keyword">struct </span>property_map<<a class="code" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a>* <span class="keyword">const</span>, vertex_index_t>
<a name="l00901"></a>00901 : property_map<vtkDirectedGraph*, vertex_index_t> { };
<a name="l00902"></a>00902
<a name="l00903"></a>00903 <span class="keyword">template</span><>
<a name="l00904"></a><a class="code" href="a00055.html">00904</a> <span class="keyword">struct </span>property_map<<a class="code" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a>* <span class="keyword">const</span>, vertex_index_t>
<a name="l00905"></a>00905 : property_map<vtkUndirectedGraph*, vertex_index_t> { };
<a name="l00906"></a>00906
<a name="l00907"></a>00907 <span class="keyword">template</span><>
<a name="l00908"></a><a class="code" href="a00044.html">00908</a> <span class="keyword">struct </span>property_map<<a class="code" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a>* <span class="keyword">const</span>, edge_index_t>
<a name="l00909"></a>00909 : property_map<vtkDirectedGraph*, edge_index_t> { };
<a name="l00910"></a>00910
<a name="l00911"></a>00911 <span class="keyword">template</span><>
<a name="l00912"></a><a class="code" href="a00054.html">00912</a> <span class="keyword">struct </span>property_map<<a class="code" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a>* <span class="keyword">const</span>, edge_index_t>
<a name="l00913"></a>00913 : property_map<vtkUndirectedGraph*, edge_index_t> { };
<a name="l00914"></a>00914
<a name="l00915"></a>00915 } <span class="comment">// namespace boost</span>
<a name="l00916"></a>00916
<a name="l00917"></a>00917
<a name="l00918"></a>00918 <span class="preprocessor">#endif // __vtkBoostGraphAdapter_h</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
>
4787
