<!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: vtkMutableUndirectedGraph Class Reference</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.6 -->
<div class="navigation" id="top">
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li class="current"><a href="classes.html"><span>Classes</span></a></li>
<li><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="classes.html"><span>Alphabetical List</span></a></li>
<li><a href="annotated.html"><span>Class List</span></a></li>
<li><a href="hierarchy.html"><span>Class Hierarchy</span></a></li>
<li><a href="functions.html"><span>Class Members</span></a></li>
</ul>
</div>
</div>
<div class="contents">
<h1>vtkMutableUndirectedGraph Class Reference</h1><!-- doxytag: class="vtkMutableUndirectedGraph" --><!-- doxytag: inherits="vtkUndirectedGraph" --><code>#include <<a class="el" href="a04100.html">vtkMutableUndirectedGraph.h</a>></code>
<p>
<div class="dynheader">
Inheritance diagram for vtkMutableUndirectedGraph:</div>
<div class="dynsection">
<p><center><img src="a12331.png" border="0" usemap="#a12332" alt="Inheritance graph"></center>
<map name="a12332">
<area shape="rect" href="a01776.html" title="An undirected graph." alt="" coords="30,304,174,331"><area shape="rect" href="a00654.html" title="Base class for graph data types." alt="" coords="63,230,140,256"><area shape="rect" href="a00362.html" title="general representation of visualization data" alt="" coords="48,155,155,182"><area shape="rect" href="a01084.html" title="abstract base class for most VTK objects" alt="" coords="62,80,142,107"><area shape="rect" href="a01085.html" title="abstract base class for most VTK objects" alt="" coords="47,6,156,32"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
<div class="dynheader">
Collaboration diagram for vtkMutableUndirectedGraph:</div>
<div class="dynsection">
<p><center><img src="a12333.png" border="0" usemap="#a12334" alt="Collaboration graph"></center>
<map name="a12334">
<area shape="rect" href="a01776.html" title="An undirected graph." alt="" coords="2351,1022,2495,1048"><area shape="rect" href="a00654.html" title="Base class for graph data types." alt="" coords="2072,866,2149,892"><area shape="rect" href="a00433.html" title="helper for the vtkGraph class that allows the graph to be distributed across multiple..." alt="" coords="2331,912,2515,939"><area shape="rect" href="a00362.html" title="general representation of visualization data" alt="" coords="1793,496,1900,523"><area shape="rect" href="a01574.html" title="abstract class specifies interface for visualization network source" alt="" coords="2381,359,2464,386"><area shape="rect" href="a01306.html" title="abstract class specifies interface for visualization filters" alt="" coords="2047,332,2175,359"><area shape="rect" href="a01084.html" title="abstract base class for most VTK objects" alt="" coords="444,499,524,526"><area shape="rect" href="a00101.html" title="Superclass for all sources, filters, and sinks in VTK." alt="" coords="1064,262,1163,288"><area shape="rect" href="a00472.html" title="Superclass for all pipeline executives in VTK." alt="" coords="1464,347,1563,374"><area shape="rect" href="a00895.html" title="Store zero or more vtkInformation instances." alt="" coords="675,352,824,379"><area shape="rect" href="a00872.html" title="Store vtkAlgorithm input/output information." alt="" coords="695,167,804,194"><area shape="rect" href="a00538.html" title="represent and manipulate fields of data" alt="" coords="1464,566,1563,592"><area shape="rect" href="a00081.html" title="Abstract superclass for all arrays." alt="" coords="1052,464,1175,491"><area shape="rect" href="a01250.html" title="represent and manipulate 3D points" alt="" coords="1808,868,1885,895"><area shape="rect" href="a01513.html" title="map scalar values into colors" alt="" coords="849,715,991,742"><area shape="rect" href="a00664.html" title="Internal representation of vtkGraph." alt="" coords="1251,774,1381,800"><area shape="rect" href="a00657.html" title="Representation of a single graph edge." alt="" coords="1631,34,1740,60"><area shape="rect" href="a01085.html" title="abstract base class for most VTK objects" alt="" coords="7,118,116,144"><area shape="rect" href="a00884.html" title="internal structure for vtkInformation" alt="" coords="403,38,565,64"><area shape="rect" href="a00886.html" title="Superclass for vtkInformation keys." alt="" coords="169,118,300,144"><area shape="rect" href="a01719.html" title="record modification and/or execution time" alt="" coords="180,970,289,996"><area shape="rect" href="a00980.html" title="map scalar values into colors via a lookup table" alt="" coords="2052,447,2169,474"><area shape="rect" href="a00891.html" title="Key for pointer to pointer." alt="" coords="393,155,575,182"><area shape="rect" href="a00376.html" title="represent and manipulate attribute data in a dataset" alt="" coords="1773,755,1920,782"><area shape="rect" href="a00356.html" title="abstract superclass for arrays of numeric data" alt="" coords="1463,436,1564,463"><area shape="rect" href="a00540.html" title="vtkFieldData::CopyFieldFlag" alt="" coords="1016,566,1211,592"><area shape="rect" href="a01784.html" title="dynamic, self-adjusting array of unsigned char" alt="" coords="1767,331,1927,358"><area shape="rect" href="a00722.html" title="dynamic, self-adjusting array of vtkIdType" alt="" coords="1789,566,1904,592"><area shape="rect" href="a00539.html" title="vtkFieldData::BasicIterator" alt="" coords="1421,727,1605,754"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
<p>
<a href="a12335.html">List of all members.</a><hr><a name="_details"></a><h2>Detailed Description</h2>
An editable undirected graph.
<p>
<a class="el" href="a01073.html" title="An editable undirected graph.">vtkMutableUndirectedGraph</a> is an undirected graph with additional functions for adding vertices and edges. <a class="el" href="a00654.html#97cee6017324e9709f7dd41f51d3d7ae">ShallowCopy()</a>, <a class="el" href="a00654.html#b264c5c0dbaa400553abdc4aa6b6f02b">DeepCopy()</a>, <a class="el" href="a00654.html#93c80d654a851b754342cc0f81a4ad28">CheckedShallowCopy()</a>, and <a class="el" href="a00654.html#3733a589dd1446186715259671912b10">CheckedDeepCopy()</a> will succeed when the argument is a <a class="el" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a> or <a class="el" href="a01073.html" title="An editable undirected graph.">vtkMutableUndirectedGraph</a>.<p>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a> <a class="el" href="a00654.html" title="Base class for graph data types.">vtkGraph</a></dd></dl>
<dl class="user" compact><dt><b>Tests:</b></dt><dd><a class="el" href="c2_vtk_t_10.html#c2_vtk_t_vtkMutableUndirectedGraph">vtkMutableUndirectedGraph (Tests)</a> </dd></dl>
<p>Definition at line <a class="el" href="a04100.html#l00044">44</a> of file <a class="el" href="a04100.html">vtkMutableUndirectedGraph.h</a>.</p>
<table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td colspan="2"><br><h2>Public Types</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">typedef <a class="el" href="a01776.html">vtkUndirectedGraph</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#1e9e4ae1818a6c58c312b58a94fc3be8">Superclass</a></td></tr>
<tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual const char * </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#145206ad25231e11b9f84d097464ebaf">GetClassName</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#e1ecf774bcc5d671b17beaeb1d175fa9">IsA</a> (const char *type)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#fab465ed1e01dea6f6ba769038ef1b28">PrintSelf</a> (ostream &os, <a class="el" href="a00869.html">vtkIndent</a> indent)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#de4e0c5b3ecd5988353e9c4901c100a2">AddVertex</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#b6176a4c33565dc143c3cef38034388b">AddVertex</a> (<a class="el" href="a01811.html">vtkVariantArray</a> *propertyArr)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00454.html">vtkEdgeType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#e3282124d33aa997c3540f7de83f1ea3">AddEdge</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> u, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#60b3cfaf830906d21b07592bf1cb79d3">LazyAddVertex</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#8061d0e95fc921e94ef2c69ae91fa4aa">LazyAddVertex</a> (<a class="el" href="a01811.html">vtkVariantArray</a> *propertyArr)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#3616a68d28d3e00ef8819a9b74814f7d">LazyAddEdge</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> u, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#853181f3281972e931bbd61d7d081bb3">LazyAddEdge</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> u, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, <a class="el" href="a01811.html">vtkVariantArray</a> *propertyArr)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00657.html">vtkGraphEdge</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#c1dce21c07c8e2862a7d5f09e0e334a7">AddGraphEdge</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> u, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#75b3da8f452b0d1bc55a7737deb9061f">AddVertex</a> (const <a class="el" href="a01810.html">vtkVariant</a> &pedigreeId)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00454.html">vtkEdgeType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#e92610245a5709ea5611a2295cc1ab72">AddEdge</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> u, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, <a class="el" href="a01811.html">vtkVariantArray</a> *propertyArr)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00454.html">vtkEdgeType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#d32b798c4d75a89079484c92f58869ab">AddEdge</a> (const <a class="el" href="a01810.html">vtkVariant</a> &uPedigreeId, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, <a class="el" href="a01811.html">vtkVariantArray</a> *propertyArr=0)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00454.html">vtkEdgeType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#db99cf1d215b0bf92b3f9a572c95df3f">AddEdge</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> u, const <a class="el" href="a01810.html">vtkVariant</a> &vPedigreeId, <a class="el" href="a01811.html">vtkVariantArray</a> *propertyArr=0)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00454.html">vtkEdgeType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#afe9ff8c1bc0c9ae27c264c9ca5ef0f1">AddEdge</a> (const <a class="el" href="a01810.html">vtkVariant</a> &uPedigreeId, const <a class="el" href="a01810.html">vtkVariant</a> &vPedigreeId, <a class="el" href="a01811.html">vtkVariantArray</a> *propertyArr=0)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#6f93ae1e9b23524a5342004848285dd7">LazyAddVertex</a> (const <a class="el" href="a01810.html">vtkVariant</a> &pedigreeId)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#854954d7a6fa82d4bc48533ec528419b">LazyAddEdge</a> (const <a class="el" href="a01810.html">vtkVariant</a> &uPedigreeId, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, <a class="el" href="a01811.html">vtkVariantArray</a> *propertyArr=0)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#57de89393ebb4b834dfc1e950279ac0b">LazyAddEdge</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> u, const <a class="el" href="a01810.html">vtkVariant</a> &vPedigreeId, <a class="el" href="a01811.html">vtkVariantArray</a> *propertyArr=0)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#3c5d52464eaa69f9414c663edf0a821d">LazyAddEdge</a> (const <a class="el" href="a01810.html">vtkVariant</a> &uPedigreeId, const <a class="el" href="a01810.html">vtkVariant</a> &vPedigreeId, <a class="el" href="a01811.html">vtkVariantArray</a> *propertyArr=0)</td></tr>
<tr><td colspan="2"><br><h2>Static Public Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static <a class="el" href="a01073.html">vtkMutableUndirectedGraph</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#c46f536ce7493b33739f34c5f968ccf5">New</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static int </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#4e276f1e5b7c4fe213d0241122e98dcc">IsTypeOf</a> (const char *type)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static <a class="el" href="a01073.html">vtkMutableUndirectedGraph</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#5b7bd1a13fa3c0ee3b161c4413936943">SafeDownCast</a> (<a class="el" href="a01084.html">vtkObject</a> *o)</td></tr>
<tr><td colspan="2"><br><h2>Protected Member Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#4311a75053fa99cf5e96f66b327c0ac1">vtkMutableUndirectedGraph</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#2078949dfe244f480ada363a7f3937f7">~vtkMutableUndirectedGraph</a> ()</td></tr>
<tr><td colspan="2"><br><h2>Protected Attributes</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00657.html">vtkGraphEdge</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a01073.html#7586f20856d0e196f651f40bb761ddb6">GraphEdge</a></td></tr>
</table>
<hr><h2>Member Typedef Documentation</h2>
<a class="anchor" name="1e9e4ae1818a6c58c312b58a94fc3be8"></a><!-- doxytag: member="vtkMutableUndirectedGraph::Superclass" ref="1e9e4ae1818a6c58c312b58a94fc3be8" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="a01776.html">vtkUndirectedGraph</a> <a class="el" href="a01776.html">vtkMutableUndirectedGraph::Superclass</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Reimplemented from <a class="el" href="a01776.html#341c630897e4eb7c6e0a4aa42d0f5a45">vtkUndirectedGraph</a>.</p>
<p>Definition at line <a class="el" href="a04100.html#l00048">48</a> of file <a class="el" href="a04100.html">vtkMutableUndirectedGraph.h</a>.</p>
</div>
</div><p>
<hr><h2>Constructor & Destructor Documentation</h2>
<a class="anchor" name="4311a75053fa99cf5e96f66b327c0ac1"></a><!-- doxytag: member="vtkMutableUndirectedGraph::vtkMutableUndirectedGraph" ref="4311a75053fa99cf5e96f66b327c0ac1" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">vtkMutableUndirectedGraph::vtkMutableUndirectedGraph </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<a class="anchor" name="2078949dfe244f480ada363a7f3937f7"></a><!-- doxytag: member="vtkMutableUndirectedGraph::~vtkMutableUndirectedGraph" ref="2078949dfe244f480ada363a7f3937f7" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">vtkMutableUndirectedGraph::~vtkMutableUndirectedGraph </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
</div>
</div><p>
<hr><h2>Member Function Documentation</h2>
<a class="anchor" name="c46f536ce7493b33739f34c5f968ccf5"></a><!-- doxytag: member="vtkMutableUndirectedGraph::New" ref="c46f536ce7493b33739f34c5f968ccf5" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static <a class="el" href="a01073.html">vtkMutableUndirectedGraph</a>* vtkMutableUndirectedGraph::New </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
<p>Reimplemented from <a class="el" href="a01776.html#faf71c727d2276dbc16f3aa90e16b4a3">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="145206ad25231e11b9f84d097464ebaf"></a><!-- doxytag: member="vtkMutableUndirectedGraph::GetClassName" ref="145206ad25231e11b9f84d097464ebaf" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual const char* vtkMutableUndirectedGraph::GetClassName </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Reimplemented from <a class="el" href="a01776.html#3088a225c619f568f5e9d9d12ccefd6e">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="4e276f1e5b7c4fe213d0241122e98dcc"></a><!-- doxytag: member="vtkMutableUndirectedGraph::IsTypeOf" ref="4e276f1e5b7c4fe213d0241122e98dcc" args="(const char *type)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static int vtkMutableUndirectedGraph::IsTypeOf </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"> <em>name</em> </td>
<td> ) </td>
<td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeRevisionMacro found in vtkSetGet.h.
<p>Reimplemented from <a class="el" href="a01776.html#1d6361a1aa3ab983d916b6e547b8cb70">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="e1ecf774bcc5d671b17beaeb1d175fa9"></a><!-- doxytag: member="vtkMutableUndirectedGraph::IsA" ref="e1ecf774bcc5d671b17beaeb1d175fa9" args="(const char *type)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual int vtkMutableUndirectedGraph::IsA </td>
<td>(</td>
<td class="paramtype">const char * </td>
<td class="paramname"> <em>name</em> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeRevisionMacro found in vtkSetGet.h.
<p>Reimplemented from <a class="el" href="a01776.html#f204c04a4d1a11ecf25896b96c1b012a">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="5b7bd1a13fa3c0ee3b161c4413936943"></a><!-- doxytag: member="vtkMutableUndirectedGraph::SafeDownCast" ref="5b7bd1a13fa3c0ee3b161c4413936943" args="(vtkObject *o)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static <a class="el" href="a01073.html">vtkMutableUndirectedGraph</a>* vtkMutableUndirectedGraph::SafeDownCast </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01084.html">vtkObject</a> * </td>
<td class="paramname"> <em>o</em> </td>
<td> ) </td>
<td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Reimplemented from <a class="el" href="a01776.html#ebdb3a38772fd0fc436185079498f95b">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="fab465ed1e01dea6f6ba769038ef1b28"></a><!-- doxytag: member="vtkMutableUndirectedGraph::PrintSelf" ref="fab465ed1e01dea6f6ba769038ef1b28" args="(ostream &os, vtkIndent indent)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkMutableUndirectedGraph::PrintSelf </td>
<td>(</td>
<td class="paramtype">ostream & </td>
<td class="paramname"> <em>os</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00869.html">vtkIndent</a> </td>
<td class="paramname"> <em>indent</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Methods invoked by print to print information about the object including superclasses. Typically not called by the user (use <a class="el" href="a01085.html#edadf6378465fd81c2592ef64262e2a5">Print()</a> instead) but used in the hierarchical print process to combine the output of several classes.
<p>Reimplemented from <a class="el" href="a01776.html#873e4dc6bc958d7f8b601448896d8fc5">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="de4e0c5b3ecd5988353e9c4901c100a2"></a><!-- doxytag: member="vtkMutableUndirectedGraph::AddVertex" ref="de4e0c5b3ecd5988353e9c4901c100a2" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkMutableUndirectedGraph::AddVertex </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds a new vertex to the graph and returns the id of that vertex. If non-null, propertyArr provides properties that will be attached to this vertex. The values in propertyArr must match up with the arrays in the vertex data retrieved by GetVertexData. In a distributed graph, this routine cannot be used to add a vertex if the vertices in the graph have pedigree IDs, because this routine will always add the vertex locally, which may conflict with the proper location of the vertex based on the distribution of the pedigree IDs.
</div>
</div><p>
<a class="anchor" name="b6176a4c33565dc143c3cef38034388b"></a><!-- doxytag: member="vtkMutableUndirectedGraph::AddVertex" ref="b6176a4c33565dc143c3cef38034388b" args="(vtkVariantArray *propertyArr)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkMutableUndirectedGraph::AddVertex </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01811.html">vtkVariantArray</a> * </td>
<td class="paramname"> <em>propertyArr</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds a new vertex to the graph and returns the id of that vertex. If non-null, propertyArr provides properties that will be attached to this vertex. The values in propertyArr must match up with the arrays in the vertex data retrieved by GetVertexData. If the graph has pedigree IDs for its vertices, and a vertex with the given pedigree ID already exists, its properties will be overwritten with the properties in propertyArr and its ID will be returned. Note that, in a distributed graph with pedigree IDs, the vertex added or found might not be local. In this case, AddVertex will wait until the vertex can be added or found remotely, so that the proper vertex ID can be returned. If you don't actually need to use the vertex ID, consider calling LazyAddVertex, which provides better performance by eliminating the delays associated with returning the vertex ID.
</div>
</div><p>
<a class="anchor" name="75b3da8f452b0d1bc55a7737deb9061f"></a><!-- doxytag: member="vtkMutableUndirectedGraph::AddVertex" ref="75b3da8f452b0d1bc55a7737deb9061f" args="(const vtkVariant &pedigreeId)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkMutableUndirectedGraph::AddVertex </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a01810.html">vtkVariant</a> & </td>
<td class="paramname"> <em>pedigreeId</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds a vertex with the given pedigree ID to the graph (if a vertex with that pedigree ID does not already exist) and returns the id the vertex with that pedigree ID. If a vertex with the given pedigree ID already exists, its ID will be returned. Note that, in a distributed graph, the vertex added or found might not be local. In this case, AddVertex will wait until the vertex can be added or found remotely, so that the proper vertex ID can be returned. If you don't actually need to use the vertex ID, consider calling LazyAddVertex, which provides better performance by eliminating the delays associated with returning the vertex ID.
</div>
</div><p>
<a class="anchor" name="e3282124d33aa997c3540f7de83f1ea3"></a><!-- doxytag: member="vtkMutableUndirectedGraph::AddEdge" ref="e3282124d33aa997c3540f7de83f1ea3" args="(vtkIdType u, vtkIdType v)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00454.html">vtkEdgeType</a> vtkMutableUndirectedGraph::AddEdge </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>u</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>v</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds an undirected edge from u to v to the graph and returns a <a class="el" href="a00454.html">vtkEdgeType</a> structure for that edge. If provided, propertyArr provides edge properties for the newly-created edge. The values in propertyArr must match up with the arrays in the edge data returned by GetEdgeData. Both u and v must refer to vertices already in the graph.
</div>
</div><p>
<a class="anchor" name="e92610245a5709ea5611a2295cc1ab72"></a><!-- doxytag: member="vtkMutableUndirectedGraph::AddEdge" ref="e92610245a5709ea5611a2295cc1ab72" args="(vtkIdType u, vtkIdType v, vtkVariantArray *propertyArr)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00454.html">vtkEdgeType</a> vtkMutableUndirectedGraph::AddEdge </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>u</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>v</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a01811.html">vtkVariantArray</a> * </td>
<td class="paramname"> <em>propertyArr</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds an undirected edge from u to v to the graph and returns a <a class="el" href="a00454.html">vtkEdgeType</a> structure for that edge. If provided, propertyArr provides edge properties for the newly-created edge. The values in propertyArr must match up with the arrays in the edge data returned by GetEdgeData. Both u and v must refer to vertices already in the graph.
</div>
</div><p>
<a class="anchor" name="d32b798c4d75a89079484c92f58869ab"></a><!-- doxytag: member="vtkMutableUndirectedGraph::AddEdge" ref="d32b798c4d75a89079484c92f58869ab" args="(const vtkVariant &uPedigreeId, vtkIdType v, vtkVariantArray *propertyArr=0)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00454.html">vtkEdgeType</a> vtkMutableUndirectedGraph::AddEdge </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a01810.html">vtkVariant</a> & </td>
<td class="paramname"> <em>uPedigreeId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>v</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a01811.html">vtkVariantArray</a> * </td>
<td class="paramname"> <em>propertyArr</em> = <code>0</code></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds an undirected edge from u to v to the graph and returns a <a class="el" href="a00454.html">vtkEdgeType</a> structure for that edge. uPedigreeId is the pedigree ID of a vertex, which will be automatically added if it does not already exist. v must refer to a vertex already in the graph. If provided, propertyArr provides edge properties for the newly-created edge. The values in propertyArr must match up with the arrays in the edge data returned by GetEdgeData.
</div>
</div><p>
<a class="anchor" name="db99cf1d215b0bf92b3f9a572c95df3f"></a><!-- doxytag: member="vtkMutableUndirectedGraph::AddEdge" ref="db99cf1d215b0bf92b3f9a572c95df3f" args="(vtkIdType u, const vtkVariant &vPedigreeId, vtkVariantArray *propertyArr=0)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00454.html">vtkEdgeType</a> vtkMutableUndirectedGraph::AddEdge </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>u</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="a01810.html">vtkVariant</a> & </td>
<td class="paramname"> <em>vPedigreeId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a01811.html">vtkVariantArray</a> * </td>
<td class="paramname"> <em>propertyArr</em> = <code>0</code></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds an undirected edge from u to v to the graph and returns a <a class="el" href="a00454.html">vtkEdgeType</a> structure for that edge. vPedigreeId is the pedigree ID of a vertex, which will be automatically added if it does not already exist. u must refer to a vertex already in the graph. If provided, propertyArr provides edge properties for the newly-created edge. The values in propertyArr must match up with the arrays in the edge data returned by GetEdgeData.
</div>
</div><p>
<a class="anchor" name="afe9ff8c1bc0c9ae27c264c9ca5ef0f1"></a><!-- doxytag: member="vtkMutableUndirectedGraph::AddEdge" ref="afe9ff8c1bc0c9ae27c264c9ca5ef0f1" args="(const vtkVariant &uPedigreeId, const vtkVariant &vPedigreeId, vtkVariantArray *propertyArr=0)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00454.html">vtkEdgeType</a> vtkMutableUndirectedGraph::AddEdge </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a01810.html">vtkVariant</a> & </td>
<td class="paramname"> <em>uPedigreeId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="a01810.html">vtkVariant</a> & </td>
<td class="paramname"> <em>vPedigreeId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a01811.html">vtkVariantArray</a> * </td>
<td class="paramname"> <em>propertyArr</em> = <code>0</code></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds an undirected edge from u to v to the graph and returns a <a class="el" href="a00454.html">vtkEdgeType</a> structure for that edge. uPedigreeId and vPedigreeId are the pedigree IDs of vertices u and v, which will be automatically added if they do not already exist. If provided, propertyArr provides edge properties for the newly-created edge. The values in propertyArr must match up with the arrays in the edge data returned by GetEdgeData.
</div>
</div><p>
<a class="anchor" name="60b3cfaf830906d21b07592bf1cb79d3"></a><!-- doxytag: member="vtkMutableUndirectedGraph::LazyAddVertex" ref="60b3cfaf830906d21b07592bf1cb79d3" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkMutableUndirectedGraph::LazyAddVertex </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds a vertex to the graph, and returns the id of that vertex. If non-null, propertyArr provides properties that will be attached to this vertex. The values in propertyArr must match up with the arrays in the vertex data retrieved by GetVertexData. In a distributed graph, this routine cannot be used to add a vertex if the vertices in the graph have pedigree IDs, because this routine will always add the vertex locally, which may conflict with the proper location of the vertex based on the distribution of the pedigree IDs.
</div>
</div><p>
<a class="anchor" name="8061d0e95fc921e94ef2c69ae91fa4aa"></a><!-- doxytag: member="vtkMutableUndirectedGraph::LazyAddVertex" ref="8061d0e95fc921e94ef2c69ae91fa4aa" args="(vtkVariantArray *propertyArr)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkMutableUndirectedGraph::LazyAddVertex </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01811.html">vtkVariantArray</a> * </td>
<td class="paramname"> <em>propertyArr</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds a vertex to the graph, and returns the id of that vertex. If non-null, propertyArr provides properties that will be attached to this vertex. The values in propertyArr must match up with the arrays in the vertex data retrieved by GetVertexData. If the graph has pedigree IDs for its vertices, and a vertex with the given pedigree ID already exists, its properties will be overwritten with the properties in propertyArr. Note that, in a distributed graph with pedigree IDs, the vertex added or found might not be local. In these cases, LazyAddVertex can be significantly faster than AddVertex, because it does not have to return the resulting vertex ID to the caller.
</div>
</div><p>
<a class="anchor" name="6f93ae1e9b23524a5342004848285dd7"></a><!-- doxytag: member="vtkMutableUndirectedGraph::LazyAddVertex" ref="6f93ae1e9b23524a5342004848285dd7" args="(const vtkVariant &pedigreeId)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkMutableUndirectedGraph::LazyAddVertex </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a01810.html">vtkVariant</a> & </td>
<td class="paramname"> <em>pedigreeId</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds a vertex with the given pedigree ID to the graph (if a vertex with that pedigree ID does not already exist). Note that, in a distributed graph, the vertex added or found might not be local. In these cases, LazyAddVertex can be significantly faster than AddVertex, because it does not have to return the resulting vertex ID to the caller.
</div>
</div><p>
<a class="anchor" name="3616a68d28d3e00ef8819a9b74814f7d"></a><!-- doxytag: member="vtkMutableUndirectedGraph::LazyAddEdge" ref="3616a68d28d3e00ef8819a9b74814f7d" args="(vtkIdType u, vtkIdType v)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkMutableUndirectedGraph::LazyAddEdge </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>u</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>v</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds an undirected edge from u to v to the graph. The edge may not be added immediately, which provides more optimization opportunities for distributed graphs; consequently, the edge itself is not actually returned. u and v must refer to vertices in the graph.
</div>
</div><p>
<a class="anchor" name="853181f3281972e931bbd61d7d081bb3"></a><!-- doxytag: member="vtkMutableUndirectedGraph::LazyAddEdge" ref="853181f3281972e931bbd61d7d081bb3" args="(vtkIdType u, vtkIdType v, vtkVariantArray *propertyArr)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkMutableUndirectedGraph::LazyAddEdge </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>u</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>v</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a01811.html">vtkVariantArray</a> * </td>
<td class="paramname"> <em>propertyArr</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds an undirected edge from u to v to the graph. The edge may not be added immediately, which provides more optimization opportunities for distributed graphs; consequently, the edge itself is not actually returned. u and v must refer to vertices in the graph. If non-NULL, propertyArr provides edge properties for the newly-created edge. The values in propertyArr must match up with the arrays in the edge data returned by GetEdgeData.
</div>
</div><p>
<a class="anchor" name="854954d7a6fa82d4bc48533ec528419b"></a><!-- doxytag: member="vtkMutableUndirectedGraph::LazyAddEdge" ref="854954d7a6fa82d4bc48533ec528419b" args="(const vtkVariant &uPedigreeId, vtkIdType v, vtkVariantArray *propertyArr=0)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkMutableUndirectedGraph::LazyAddEdge </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a01810.html">vtkVariant</a> & </td>
<td class="paramname"> <em>uPedigreeId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>v</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a01811.html">vtkVariantArray</a> * </td>
<td class="paramname"> <em>propertyArr</em> = <code>0</code></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds an undirected edge from u to v to the graph. The edge may not be added immediately, which provides more optimization opportunities for distributed graphs; consequently, the edge itself is not actually returned. uPedigreeId is the pedigree ID of a vertex, which will be automatically added if it does not already exist. v must refer to a vertex in the graph. If provided, propertyArr provides edge properties for the newly-created edge. The values in propertyArr must match up with the arrays in the edge data returned by GetEdgeData.
</div>
</div><p>
<a class="anchor" name="57de89393ebb4b834dfc1e950279ac0b"></a><!-- doxytag: member="vtkMutableUndirectedGraph::LazyAddEdge" ref="57de89393ebb4b834dfc1e950279ac0b" args="(vtkIdType u, const vtkVariant &vPedigreeId, vtkVariantArray *propertyArr=0)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkMutableUndirectedGraph::LazyAddEdge </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>u</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="a01810.html">vtkVariant</a> & </td>
<td class="paramname"> <em>vPedigreeId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a01811.html">vtkVariantArray</a> * </td>
<td class="paramname"> <em>propertyArr</em> = <code>0</code></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds an undirected edge from u to v to the graph. The edge may not be added immediately, which provides more optimization opportunities for distributed graphs; consequently, the edge itself is not actually returned. vPedigreeId is the pedigree ID of a vertex, which will be automatically added if it does not already exist. u must refer to a vertex in the graph. If provided, propertyArr provides edge properties for the newly-created edge. The values in propertyArr must match up with the arrays in the edge data returned by GetEdgeData.
</div>
</div><p>
<a class="anchor" name="3c5d52464eaa69f9414c663edf0a821d"></a><!-- doxytag: member="vtkMutableUndirectedGraph::LazyAddEdge" ref="3c5d52464eaa69f9414c663edf0a821d" args="(const vtkVariant &uPedigreeId, const vtkVariant &vPedigreeId, vtkVariantArray *propertyArr=0)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkMutableUndirectedGraph::LazyAddEdge </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a01810.html">vtkVariant</a> & </td>
<td class="paramname"> <em>uPedigreeId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="el" href="a01810.html">vtkVariant</a> & </td>
<td class="paramname"> <em>vPedigreeId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a01811.html">vtkVariantArray</a> * </td>
<td class="paramname"> <em>propertyArr</em> = <code>0</code></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds an undirected edge from u to v to the graph. The edge may not be added immediately, which provides more optimization opportunities for distributed graphs; consequently, the edge itself is not actually returned. uPedigreeId and vPedigreeId are the pedigree IDs of vertices u and v, which will be automatically added if they do not already exist. If provided, propertyArr provides edge properties for the newly-created edge. The values in propertyArr must match up with the arrays in the edge data returned by GetEdgeData.
</div>
</div><p>
<a class="anchor" name="c1dce21c07c8e2862a7d5f09e0e334a7"></a><!-- doxytag: member="vtkMutableUndirectedGraph::AddGraphEdge" ref="c1dce21c07c8e2862a7d5f09e0e334a7" args="(vtkIdType u, vtkIdType v)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00657.html">vtkGraphEdge</a>* vtkMutableUndirectedGraph::AddGraphEdge </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>u</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>v</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Version of AddEdge that returns a heavyweight <a class="el" href="a00657.html" title="Representation of a single graph edge.">vtkGraphEdge</a> for use with wrappers. The graph owns the reference of the edge and will replace its contents on the next call to AddGraphEdge.
</div>
</div><p>
<hr><h2>Member Data Documentation</h2>
<a class="anchor" name="7586f20856d0e196f651f40bb761ddb6"></a><!-- doxytag: member="vtkMutableUndirectedGraph::GraphEdge" ref="7586f20856d0e196f651f40bb761ddb6" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00657.html">vtkGraphEdge</a>* <a class="el" href="a01073.html#7586f20856d0e196f651f40bb761ddb6">vtkMutableUndirectedGraph::GraphEdge</a><code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Graph edge that is reused of AddGraphEdge calls.
<p>Definition at line <a class="el" href="a04100.html#l00252">252</a> of file <a class="el" href="a04100.html">vtkMutableUndirectedGraph.h</a>.</p>
</div>
</div><p>
<hr>The documentation for this class was generated from the following file:<ul>
<li>dox/Filtering/<a class="el" href="a04100.html">vtkMutableUndirectedGraph.h</a></ul>
</div>
<hr size="1"><address style="text-align: right;"><small>Generated on Wed Jun 3 19:19:12 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
>
1076
