<!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: vtkGraph 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>vtkGraph Class Reference</h1><!-- doxytag: class="vtkGraph" --><!-- doxytag: inherits="vtkDataObject" --><code>#include <<a class="el" href="a04053.html">vtkGraph.h</a>></code>
<p>
<div class="dynheader">
Inheritance diagram for vtkGraph:</div>
<div class="dynsection">
<p><center><img src="a10345.png" border="0" usemap="#a10346" alt="Inheritance graph"></center>
<map name="a10346">
<area shape="rect" href="a00421.html" title="A directed graph." alt="" coords="224,304,352,331"><area shape="rect" href="a01776.html" title="An undirected graph." alt="" coords="400,304,544,331"><area shape="rect" href="a00362.html" title="general representation of visualization data" alt="" coords="315,155,421,181"><area shape="rect" href="a01084.html" title="abstract base class for most VTK objects" alt="" coords="328,80,408,107"><area shape="rect" href="a01085.html" title="abstract base class for most VTK objects" alt="" coords="313,5,423,32"><area shape="rect" href="a00420.html" title="A rooted tree data structure." alt="" coords="5,379,176,405"><area shape="rect" href="a01071.html" title="An editable directed graph." alt="" coords="200,379,376,405"><area shape="rect" href="a01741.html" title="A rooted tree data structure." alt="" coords="57,453,124,480"><area shape="rect" href="a01073.html" title="An editable undirected graph." alt="" coords="400,379,592,405"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
<div class="dynheader">
Collaboration diagram for vtkGraph:</div>
<div class="dynsection">
<p><center><img src="a10347.png" border="0" usemap="#a10348" alt="Collaboration graph"></center>
<map name="a10348">
<area shape="rect" href="a00433.html" title="helper for the vtkGraph class that allows the graph to be distributed across multiple..." alt="" coords="2315,469,2499,496"><area shape="rect" href="a00362.html" title="general representation of visualization data" alt="" coords="1777,857,1884,884"><area shape="rect" href="a01574.html" title="abstract class specifies interface for visualization network source" alt="" coords="2365,781,2448,808"><area shape="rect" href="a01306.html" title="abstract class specifies interface for visualization filters" alt="" coords="2031,751,2159,777"><area shape="rect" href="a01084.html" title="abstract base class for most VTK objects" alt="" coords="444,661,524,688"><area shape="rect" href="a00101.html" title="Superclass for all sources, filters, and sinks in VTK." alt="" coords="1064,647,1163,673"><area shape="rect" href="a00472.html" title="Superclass for all pipeline executives in VTK." alt="" coords="1464,548,1563,575"><area shape="rect" href="a00895.html" title="Store zero or more vtkInformation instances." alt="" coords="675,515,824,541"><area shape="rect" href="a00872.html" title="Store vtkAlgorithm input/output information." alt="" coords="695,908,804,935"><area shape="rect" href="a00538.html" title="represent and manipulate fields of data" alt="" coords="1464,793,1563,820"><area shape="rect" href="a00081.html" title="Abstract superclass for all arrays." alt="" coords="1052,715,1175,741"><area shape="rect" href="a01250.html" title="represent and manipulate 3D points" alt="" coords="1792,303,1869,329"><area shape="rect" href="a01513.html" title="map scalar values into colors" alt="" coords="849,889,991,916"><area shape="rect" href="a00664.html" title="Internal representation of vtkGraph." alt="" coords="1251,368,1381,395"><area shape="rect" href="a01085.html" title="abstract base class for most VTK objects" alt="" coords="7,1100,116,1127"><area shape="rect" href="a00884.html" title="internal structure for vtkInformation" alt="" coords="403,1113,565,1140"><area shape="rect" href="a00886.html" title="Superclass for vtkInformation keys." alt="" coords="169,1100,300,1127"><area shape="rect" href="a01719.html" title="record modification and/or execution time" alt="" coords="180,236,289,263"><area shape="rect" href="a00980.html" title="map scalar values into colors via a lookup table" alt="" coords="2036,612,2153,639"><area shape="rect" href="a00891.html" title="Key for pointer to pointer." alt="" coords="393,1063,575,1089"><area shape="rect" href="a00376.html" title="represent and manipulate attribute data in a dataset" alt="" coords="1757,423,1904,449"><area shape="rect" href="a00356.html" title="abstract superclass for arrays of numeric data" alt="" coords="1463,599,1564,625"><area shape="rect" href="a00540.html" title="vtkFieldData::CopyFieldFlag" alt="" coords="1016,769,1211,796"><area shape="rect" href="a01784.html" title="dynamic, self-adjusting array of unsigned char" alt="" coords="1751,645,1911,672"><area shape="rect" href="a00722.html" title="dynamic, self-adjusting array of vtkIdType" alt="" coords="1773,473,1888,500"><area shape="rect" href="a00539.html" title="vtkFieldData::BasicIterator" alt="" coords="1421,447,1605,473"></map>
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center></div>
<p>
<a href="a10349.html">List of all members.</a><hr><a name="_details"></a><h2>Detailed Description</h2>
Base class for graph data types.
<p>
<a class="el" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> is the abstract base class that provides all read-only API for graph data types. A graph consists of a collection of vertices and a collection of edges connecting pairs of vertices. The <a class="el" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a> subclass represents a graph whose edges have inherent order from source vertex to target vertex, while <a class="el" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a> is a graph whose edges have no inherent ordering.<p>
Graph vertices may be traversed in two ways. In the current implementation, all vertices are assigned consecutive ids starting at zero, so they may be traversed in a simple for loop from 0 to graph-><a class="el" href="a00654.html#1acbb7b69387ec2a08956d1d9d11c679">GetNumberOfVertices()</a> - 1. You may alternately create a <a class="el" href="a01826.html" title="Iterates all vertices in a graph.">vtkVertexListIterator</a> and call graph->GetVertices(it). it->Next() will return the id of the next vertex, while it->HasNext() indicates whether there are more vertices in the graph. This is the preferred method, since in the future graphs may support filtering or subsetting where the vertex ids may not be contiguous.<p>
Graph edges must be traversed through iterators. To traverse all edges in a graph, create an instance of <a class="el" href="a00450.html" title="Iterates through all edges in a graph.">vtkEdgeListIterator</a> and call graph->GetEdges(it). it->Next() returns lightweight <a class="el" href="a00454.html">vtkEdgeType</a> structures, which contain the public fields Id, Source and Target. Id is the identifier for the edge, which may be used to look up values in assiciated edge data arrays. Source and Target store the ids of the source and target vertices of the edge. Note that the edge list iterator DOES NOT necessarily iterate over edges in order of ascending id. To traverse edges from wrapper code (Python, Tcl, Java), use it->NextGraphEdge() instead of it->Next(). This will return a heavyweight, wrappable <a class="el" href="a00657.html" title="Representation of a single graph edge.">vtkGraphEdge</a> object, which has the same fields as <a class="el" href="a00454.html">vtkEdgeType</a> accessible through getter methods.<p>
To traverse all edges outgoing from a vertex, create a <a class="el" href="a01137.html" title="Iterates through all outgoing edges from a vertex.">vtkOutEdgeIterator</a> and call graph->GetOutEdges(v, it). it->Next() returns a lightweight <a class="el" href="a01138.html">vtkOutEdgeType</a> containing the fields Id and Target. The source of the edge is always the vertex that was passed as an argument to <a class="el" href="a00654.html#a9e590baa974a7fc0f601c8c7383fd3f">GetOutEdges()</a>. Incoming edges may be similarly traversed with <a class="el" href="a00870.html" title="Iterates through all incoming edges to a vertex.">vtkInEdgeIterator</a>, which returns <a class="el" href="a00871.html">vtkInEdgeType</a> structures with Id and Source fields. Both <a class="el" href="a01137.html" title="Iterates through all outgoing edges from a vertex.">vtkOutEdgeIterator</a> and <a class="el" href="a00870.html" title="Iterates through all incoming edges to a vertex.">vtkInEdgeIterator</a> also provide the wrapper functions NextGraphEdge() which return <a class="el" href="a00657.html" title="Representation of a single graph edge.">vtkGraphEdge</a> objects.<p>
An additional iterator, <a class="el" href="a00097.html" title="Iterates through adjacent vertices in a graph.">vtkAdjacentVertexIterator</a> can traverse outgoing vertices directly, instead needing to parse through edges. Initialize the iterator by calling graph->GetAdjacentVertices(v, it).<p>
<a class="el" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> has two instances of <a class="el" href="a00376.html" title="represent and manipulate attribute data in a dataset">vtkDataSetAttributes</a> for associated vertex and edge data. It also has a <a class="el" href="a01250.html" title="represent and manipulate 3D points">vtkPoints</a> instance which may store x,y,z locations for each vertex. This is populated by filters such as <a class="el" href="a00665.html" title="layout a graph in 2 or 3 dimensions">vtkGraphLayout</a> and <a class="el" href="a00146.html" title="Given two(or three) arrays take the values in those arrays and simply assign them...">vtkAssignCoordinates</a>.<p>
All graph types share the same implementation, so the structure of one may be shared among multiple graphs, even graphs of different types. Structures from <a class="el" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a> and <a class="el" href="a01073.html" title="An editable undirected graph.">vtkMutableUndirectedGraph</a> may be shared directly. Structures from <a class="el" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a>, <a class="el" href="a01071.html" title="An editable directed graph.">vtkMutableDirectedGraph</a>, and <a class="el" href="a01741.html" title="A rooted tree data structure.">vtkTree</a> may be shared directly with the exception that setting a structure to a tree requires that a "is a tree" test passes.<p>
For graph types that are known to be compatible, calling <a class="el" href="a00654.html#97cee6017324e9709f7dd41f51d3d7ae">ShallowCopy()</a> or <a class="el" href="a00654.html#b264c5c0dbaa400553abdc4aa6b6f02b">DeepCopy()</a> will work as expected. When the outcome of a conversion is unknown (i.e. setting a graph to a tree), <a class="el" href="a00654.html#93c80d654a851b754342cc0f81a4ad28">CheckedShallowCopy()</a> and <a class="el" href="a00654.html#3733a589dd1446186715259671912b10">CheckedDeepCopy()</a> exist which are identical to <a class="el" href="a00654.html#97cee6017324e9709f7dd41f51d3d7ae">ShallowCopy()</a> and <a class="el" href="a00654.html#b264c5c0dbaa400553abdc4aa6b6f02b">DeepCopy()</a>, except that instead of emitting an error for an incompatible structure, the function returns false. This allows you to programmatically check structure compatibility without causing error messages.<p>
To construct a graph, use <a class="el" href="a01071.html" title="An editable directed graph.">vtkMutableDirectedGraph</a> or <a class="el" href="a01073.html" title="An editable undirected graph.">vtkMutableUndirectedGraph</a>. You may then use CheckedShallowCopy to set the contents of a mutable graph type into one of the non-mutable types <a class="el" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a>, <a class="el" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a>. To construct a tree, use <a class="el" href="a01071.html" title="An editable directed graph.">vtkMutableDirectedGraph</a>, with directed edges which point from the parent to the child, then use CheckedShallowCopy to set the structure to a <a class="el" href="a01741.html" title="A rooted tree data structure.">vtkTree</a>.<p>
<dl class="warning" compact><dt><b>Warning:</b></dt><dd>All copy operations implement copy-on-write. The structures are initially shared, but if one of the graphs is modified, the structure is copied so that to the user they function as if they were deep copied. This means that care must be taken if different threads are accessing different graph instances that share the same structure. Race conditions may develop if one thread is modifying the graph at the same time that another graph is copying the structure.</dd></dl>
<dl class="user" compact><dt><b>Vertex pedigree IDs:</b></dt><dd>The vertices in a <a class="el" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> can be associated with pedigree IDs through <a class="el" href="a00654.html#3d093749e0e690e9154b1c6b52420462">GetVertexData()</a>->SetPedigreeIds. In this case, there is a 1-1 mapping between pedigree Ids and vertices. One can query the vertex ID based on the pedigree ID using FindVertex, add new vertices by pedigree ID with AddVertex, and add edges based on the pedigree IDs of the source and target vertices. For example, AddEdge("Here", "There") will find (or add) vertices with pedigree ID "Here" and "There" and then introduce an edge from "Here" to "There".</dd></dl>
<dl class="user" compact><dt><b>Vertex pedigree IDs:</b></dt><dd>To configure the <a class="el" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> with a pedigree ID mapping, create a <a class="el" href="a00356.html" title="abstract superclass for arrays of numeric data">vtkDataArray</a> that will store the pedigree IDs and set that array as the pedigree ID array for the vertices via <a class="el" href="a00654.html#3d093749e0e690e9154b1c6b52420462">GetVertexData()</a>->SetPedigreeIds().</dd></dl>
<dl class="user" compact><dt><b>Distributed graphs:</b></dt><dd><a class="el" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> instances can be distributed across multiple machines, to allow the construction and manipulation of graphs larger than a single machine could handle. A distributed graph will typically be distributed across many different nodes within a cluster, using the Message Passing Interface (MPI) to allow those cluster nodes to communicate.</dd></dl>
<dl class="user" compact><dt><b>Distributed graphs:</b></dt><dd>An empty <a class="el" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> can be made into a distributed graph by attaching an instance of a <a class="el" href="a00433.html" title="helper for the vtkGraph class that allows the graph to be distributed across multiple...">vtkDistributedGraphHelper</a> via the <a class="el" href="a00654.html#2f06360e1a493e0de0b7bea62dbabd31">SetDistributedGraphHelper()</a> method. To determine whether a graph is distributed or not, call <a class="el" href="a00654.html#09924a04ae4c4d22d621b65f237e6f22">GetDistributedGraphHelper()</a> and check whether the result is non-NULL. For a distributed graph, the number of processors across which the graph is distributed can be retrieved by extracting the value for the DATA_NUMBER_OF_PIECES key in the <a class="el" href="a00872.html" title="Store vtkAlgorithm input/output information.">vtkInformation</a> object (retrieved by <a class="el" href="a00362.html#cdfda34e33725ee93cebf3da57d35248">GetInformation()</a>) associated with the graph. Similarly, the value corresponding to the DATA_PIECE_NUMBER key of the <a class="el" href="a00872.html" title="Store vtkAlgorithm input/output information.">vtkInformation</a> object describes which piece of the data this graph instance provides.</dd></dl>
<dl class="user" compact><dt><b>Distributed graphs:</b></dt><dd>Distributed graphs behave somewhat differently from non-distributed graphs, and will require special care. In a distributed graph, each of the processors will contain a subset of the vertices in the graph. That subset of vertices can be accessed via the <a class="el" href="a01826.html" title="Iterates all vertices in a graph.">vtkVertexListIterator</a> produced by <a class="el" href="a00654.html#eeed05aabf5e82e2fb934756482d9cf2">GetVertices()</a>. <a class="el" href="a00654.html#1acbb7b69387ec2a08956d1d9d11c679">GetNumberOfVertices()</a>, therefore, returns the number of vertices stored locally: it does not account for vertices stored on other processors. A vertex (or edge) is identified by both the rank of its owning processor and by its index within that processor, both of which are encoded within the vtkIdType value that describes that vertex (or edge). The owning processor is a value between 0 and P-1, where P is the number of processors across which the <a class="el" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> has been distributed. The local index will be a value between 0 and <a class="el" href="a00654.html#1acbb7b69387ec2a08956d1d9d11c679">GetNumberOfVertices()</a>, for vertices, or <a class="el" href="a00654.html#c3534f310838e2303919825f0ec436ff">GetNumberOfEdges()</a>, for edges, and can be used to access the local parts of distributed data arrays. When given a vtkIdType identifying a vertex, one can determine the owner of the vertex with <a class="el" href="a00433.html#3b19f0f0109bb7506a1b407b7d5faa0e">vtkDistributedGraphHelper::GetVertexOwner()</a> and the local index with <a class="el" href="a00433.html#fd74ca56cf44399649ac417e32f5201d">vtkDistributedGraphHelper::GetVertexIndex()</a>. With edges, the appropriate methods are <a class="el" href="a00433.html#be66bdbdc86211d6f4570c11dc77a137">vtkDistributedGraphHelper::GetEdgeOwner()</a> and <a class="el" href="a00433.html#1f69459376d05b3b8f865d7aeea3a526">vtkDistributedGraphHelper::GetEdgeIndex()</a>, respectively. To construct a vtkIdType representing either a vertex or edge given only its owner and local index, use <a class="el" href="a00433.html#1aa236e2ac760b9e2d72157889609e38">vtkDistributedGraphHelper::MakeDistributedId()</a>.</dd></dl>
<dl class="user" compact><dt><b>Distributed graphs:</b></dt><dd>The edges in a distributed graph are always stored on the processors that own the vertices named by the edge. For example, given a directed edge (u, v), the edge will be stored in the out-edges list for vertex u on the processor that owns u, and in the in-edges list for vertex v on the processor that owns v. This "row-wise" decomposition of the graph means that, for any vertex that is local to a processor, that processor can look at all of the incoming and outgoing edges of the graph. Processors cannot, however, access the incoming or outgoing edge lists of vertex owned by other processors. Vertices owned by other processors will not be encountered when traversing the vertex list via <a class="el" href="a00654.html#eeed05aabf5e82e2fb934756482d9cf2">GetVertices()</a>, but may be encountered by traversing the in- and out-edge lists of local vertices or the edge list.</dd></dl>
<dl class="user" compact><dt><b>Distributed graphs:</b></dt><dd>Distributed graphs can have pedigree IDs for the vertices in the same way that non-distributed graphs can. In this case, the distribution of the vertices in the graph is based on pedigree ID. For example, a vertex with the pedigree ID "Here" might land on processor 0 while a vertex pedigree ID "There" would end up on processor 3. By default, the pedigree IDs themselves are hashed to give a random (and, hopefully, even) distribution of the vertices. However, one can provide a different vertex distribution function by calling <a class="el" href="a00433.html#65c2ce8d5da5908b514dd564f120445a">vtkDistributedGraphHelper::SetVertexPedigreeIdDistribution</a>. Once a distributed graph has pedigree IDs, the no-argument AddVertex() method can no longer be used. Additionally, once a vertex has a pedigree ID, that pedigree ID should not be changed unless the user can guarantee that the vertex distribution will still map that vertex to the same processor where it already resides.</dd></dl>
<dl class="see" compact><dt><b>See also:</b></dt><dd><a class="el" href="a00421.html" title="A directed graph.">vtkDirectedGraph</a> <a class="el" href="a01776.html" title="An undirected graph.">vtkUndirectedGraph</a> <a class="el" href="a01071.html" title="An editable directed graph.">vtkMutableDirectedGraph</a> <a class="el" href="a01073.html" title="An editable undirected graph.">vtkMutableUndirectedGraph</a> <a class="el" href="a01741.html" title="A rooted tree data structure.">vtkTree</a> <a class="el" href="a00433.html" title="helper for the vtkGraph class that allows the graph to be distributed across multiple...">vtkDistributedGraphHelper</a></dd></dl>
<dl class="user" compact><dt><b>Thanks:</b></dt><dd>Thanks to Brian Wylie, Timothy Shead, Ken Moreland of Sandia National Laboratories and Douglas Gregor of Indiana University for designing these classes.</dd></dl>
<dl class="user" compact><dt><b>Tests:</b></dt><dd><a class="el" href="c2_vtk_t_6.html#c2_vtk_t_vtkGraph">vtkGraph (Tests)</a> </dd></dl>
<p>Definition at line <a class="el" href="a04053.html#l00282">282</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
<table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a01250.html">vtkPoints</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#934a02a80bf067a488abc16fcc544d86">Points</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static double </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#fa6d615f17c6e8542b8616b9ff56565c">DefaultPoint</a> [3]</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00722.html">vtkIdTypeArray</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#5d4f7f316c2d739cf2cede440bb69034">EdgeList</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual <a class="el" href="a00722.html">vtkIdTypeArray</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#7d4479c717387a9da6548b5e1a5b43a7">GetEdgeList</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#59db17843a299a648b8050d930dc0c6b">SetEdgeList</a> (<a class="el" href="a00722.html">vtkIdTypeArray</a> *list)</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="a00362.html">vtkDataObject</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#331032de5dbbc39eedfb11ab11aa2273">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="a00654.html#2de90ef7c26974b67d9c096c2b83085d">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="a00654.html#4bbe3c34b4c84d2a6fe4b8d16c7b3077">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="a00654.html#97e1719f51cf2d0104e0718cfbb75b7b">PrintSelf</a> (ostream &os, <a class="el" href="a00869.html">vtkIndent</a> indent)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#7868f9ba271424ed385e436f48010deb">GetDataObjectType</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#bc291d25968a23e049ac507e5dc6321f">Initialize</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#18aca63b2f2ae0c5f86dee6e392481bd">ComputeBounds</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned long int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#6cb44673db1ecdf1640124f6e21d18ad">GetMTime</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#a9e590baa974a7fc0f601c8c7383fd3f">GetOutEdges</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, <a class="el" href="a01137.html">vtkOutEdgeIterator</a> *it)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#ef5ab35e5db0684677108c2bb692ed03">GetDegree</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#0475d284ef47ef037c22bff52293e202">GetOutDegree</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#ae689207dc72ec6a0d26e0ff73ad411f">GetOutEdge</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> index, <a class="el" href="a00657.html">vtkGraphEdge</a> *e)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#a1525c39b69a00be27f299293786d598">GetInEdges</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, <a class="el" href="a00870.html">vtkInEdgeIterator</a> *it)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#d57b421461510206123401cbe49eea49">GetInDegree</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#243f075a7f74ad9a06928eba03324684">GetInEdge</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> index, <a class="el" href="a00657.html">vtkGraphEdge</a> *e)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#3d59262a08c72eebbdca9e9f8f7342ed">GetAdjacentVertices</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, <a class="el" href="a00097.html">vtkAdjacentVertexIterator</a> *it)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#c0a7e6cb62db04967ef3310159fa1da1">GetEdges</a> (<a class="el" href="a00450.html">vtkEdgeListIterator</a> *it)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#c3534f310838e2303919825f0ec436ff">GetNumberOfEdges</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#eeed05aabf5e82e2fb934756482d9cf2">GetVertices</a> (<a class="el" href="a01826.html">vtkVertexListIterator</a> *it)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#1acbb7b69387ec2a08956d1d9d11c679">GetNumberOfVertices</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#2f06360e1a493e0de0b7bea62dbabd31">SetDistributedGraphHelper</a> (<a class="el" href="a00433.html">vtkDistributedGraphHelper</a> *helper)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#97cee6017324e9709f7dd41f51d3d7ae">ShallowCopy</a> (<a class="el" href="a00362.html">vtkDataObject</a> *obj)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#b264c5c0dbaa400553abdc4aa6b6f02b">DeepCopy</a> (<a class="el" href="a00362.html">vtkDataObject</a> *obj)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#89a368f963f530b5c162f274b1f5d356">CopyStructure</a> (<a class="el" href="a00654.html">vtkGraph</a> *g)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#93c80d654a851b754342cc0f81a4ad28">CheckedShallowCopy</a> (<a class="el" href="a00654.html">vtkGraph</a> *g)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#3733a589dd1446186715259671912b10">CheckedDeepCopy</a> (<a class="el" href="a00654.html">vtkGraph</a> *g)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#a07d16938b44caefac322d7bb31fcbc6">Squeeze</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#ea360183fcdcec9cd228478db7c157fa">ReorderOutVertices</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, <a class="el" href="a00722.html">vtkIdTypeArray</a> *vertices)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#6c213390ea94184af879c0ae03c0b5ba">IsSameStructure</a> (<a class="el" href="a00654.html">vtkGraph</a> *other)</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="a00654.html#30d68a3592130d02631c05c7f94e8800">GetNumberOfEdgePoints</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> e)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">double * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#9c5cfe3e2963c651f8b55f1cb3ee1998">GetEdgePoint</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> e, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> i)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#b28380ab612eb79637563398b0cdc6b6">ClearEdgePoints</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> e)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00664.html">vtkGraphInternals</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#97c9788eafce0d9eacf37cdae4cc601f">GetGraphInternals</a> (bool modifying)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual <a class="el" href="a00376.html">vtkDataSetAttributes</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#3d093749e0e690e9154b1c6b52420462">GetVertexData</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual <a class="el" href="a00376.html">vtkDataSetAttributes</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#0fb4eabd95c2bfa2c5ae12bbae6a4030">GetEdgeData</a> ()</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">double * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#b2f27329a4fab936f6afb1bc76205e1b">GetPoint</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> ptId)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#e79de0b80b793423a142df1f2747bddf">GetPoint</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> ptId, double x[3])</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="a01250.html">vtkPoints</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#8b7a79554d825719c5fd2b9dfd0e6173">GetPoints</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#9c09b2670e320b01483d09c2ddec6587">SetPoints</a> (<a class="el" href="a01250.html">vtkPoints</a> *points)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">double * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#7e9fbd6cf12f49094905e2b769cdd2a9">GetBounds</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#8bb412dff614c330fc21e86da3491d53">GetBounds</a> (double bounds[6])</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual <a class="el" href="a01138.html">vtkOutEdgeType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#e03cadadf8da7c469b540dc2e8847c99">GetOutEdge</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> index)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual <a class="el" href="a00871.html">vtkInEdgeType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#496ca01579222242644007c2ea4ec44d">GetInEdge</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> index)</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="a00433.html">vtkDistributedGraphHelper</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#09924a04ae4c4d22d621b65f237e6f22">GetDistributedGraphHelper</a> ()</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="a00654.html#4f596f7eae3b0583d799c92de472c14a">FindVertex</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="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#a3f493a7a3166cb4b79254ee7958977d">GetSourceVertex</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> e)</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="a00654.html#66470b19c072ff80b56fa43cf1b97657">GetTargetVertex</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> e)</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="a00654.html#1254b83e9bb7bc760e7d2a1dfce5312b">SetEdgePoints</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> e, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> npts, double *pts)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#d5ea4853894fc82b089617cfd08e6556">GetEdgePoints</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> e, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> &npts, double *&pts)</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="a00654.html#475c32209677496b6386abbf977bf553">SetEdgePoint</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> e, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> i, double x[3])</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#0adeb9bec97ca95749e27f24db6a0662">SetEdgePoint</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> e, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> i, double x, double y, double z)</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="a00654.html#3189322874f507812ff37fd7a6a7534c">AddEdgePoint</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> e, double x[3])</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#0e34ca8be05868b70ea2b38aa35ec321">AddEdgePoint</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> e, double x, double y, double z)</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="a00654.html#c9bf8998049056a80168cbba7220372d">ShallowCopyEdgePoints</a> (<a class="el" href="a00654.html">vtkGraph</a> *g)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#a76953da30ceba0a2f72d91ce2d9dd9e">DeepCopyEdgePoints</a> (<a class="el" href="a00654.html">vtkGraph</a> *g)</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 int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#c5aea7669e34d666a29e5ae4e2e6a8dd">IsTypeOf</a> (const char *type)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static <a class="el" href="a00654.html">vtkGraph</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#f88f7dd8a21d7b022f5f2c86107766f2">SafeDownCast</a> (<a class="el" href="a01084.html">vtkObject</a> *o)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static <a class="el" href="a00654.html">vtkGraph</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#82bd9f44771e77f1149af664e32b6614">GetData</a> (<a class="el" href="a00872.html">vtkInformation</a> *info)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">static <a class="el" href="a00654.html">vtkGraph</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#d74f654e08be8838efa976d4f232d48d">GetData</a> (<a class="el" href="a00895.html">vtkInformationVector</a> *v, int i=0)</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="a00654.html#c29576ea57baaf44ea57e472fe0126d5">vtkGraph</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#e82c2a3d8713b3e7f580f234972a199c">~vtkGraph</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#2d9646fd560f463958a82a2d31137894">AddVertexInternal</a> (const <a class="el" href="a01810.html">vtkVariant</a> &pedigree, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> *vertex)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#fe7101c5c57cb394f5db409cba70a7c1">IsStructureValid</a> (<a class="el" href="a00654.html">vtkGraph</a> *g)=0</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#8afc4412d4217619d9e0fdc0fe9c3864">CopyInternal</a> (<a class="el" href="a00654.html">vtkGraph</a> *g, bool deep)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#bcc35a0263335e3bbd8bded228d5f4c4">SetInternals</a> (<a class="el" href="a00664.html">vtkGraphInternals</a> *internals)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#d11f6310e5e6cc9c94938f958e0ccec5">SetEdgePoints</a> (vtkGraphEdgePoints *edgePoints)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#2dc27e4f2d1eb13467b2c9be13f679ff">ForceOwnership</a> ()</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#1d0680df68a2335a26cad973b25d8b93">BuildEdgeList</a> ()</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="a00654.html#09f9603e2a98f8966040dcbe50926d89">AddVertexInternal</a> (<a class="el" href="a01811.html">vtkVariantArray</a> *propertyArr=0, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> *vertex=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="a00654.html#bcadd2fa4848054349b58fa80b90bbeb">AddEdgeInternal</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> u, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, bool directed, <a class="el" href="a01811.html">vtkVariantArray</a> *propertyArr, <a class="el" href="a00454.html">vtkEdgeType</a> *edge)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#8066cd53558fea2b355de7026a24f78c">AddEdgeInternal</a> (const <a class="el" href="a01810.html">vtkVariant</a> &uPedigree, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, bool directed, <a class="el" href="a01811.html">vtkVariantArray</a> *propertyArr, <a class="el" href="a00454.html">vtkEdgeType</a> *edge)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#2c65d5df51387a9c2ca524de9f44f77a">AddEdgeInternal</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> u, const <a class="el" href="a01810.html">vtkVariant</a> &vPedigree, bool directed, <a class="el" href="a01811.html">vtkVariantArray</a> *propertyArr, <a class="el" href="a00454.html">vtkEdgeType</a> *edge)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#772762be5481f616d75c8e9527548a80">AddEdgeInternal</a> (const <a class="el" href="a01810.html">vtkVariant</a> &uPedigree, const <a class="el" href="a01810.html">vtkVariant</a> &vPedigree, bool directed, <a class="el" href="a01811.html">vtkVariantArray</a> *propertyArr, <a class="el" href="a00454.html">vtkEdgeType</a> *edge)</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#bccf244a6a9f6151a00157f6df54cbbf">GetOutEdges</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, const <a class="el" href="a01138.html">vtkOutEdgeType</a> *&edges, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> &nedges)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">virtual void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#aacdb2f91e0abffd896aadf57de18d31">GetInEdges</a> (<a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> v, const <a class="el" href="a00871.html">vtkInEdgeType</a> *&edges, <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> &nedges)</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="a00664.html">vtkGraphInternals</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#bf733c990319949d9499d78da9c8e169">Internals</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00433.html">vtkDistributedGraphHelper</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#a84e204a09598ef5cd9e33e3941003a7">DistributedHelper</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">vtkGraphEdgePoints * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#65f95314935441297609daaeaa88d3ca">EdgePoints</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">double </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#fe87268ffc715120fce9c959e325badb">Bounds</a> [6]</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a01719.html">vtkTimeStamp</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#20240c0ca7704bd42cbdb23bfd770f72">ComputeTime</a></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="a00376.html">vtkDataSetAttributes</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#3d251f46f35801c63a0338405d63c875">VertexData</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00376.html">vtkDataSetAttributes</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#d8dcf0fa3fc0e2291884e9d478a93d76">EdgeData</a></td></tr>
<tr><td colspan="2"><br><h2>Friends</h2></td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#c862ef892503aa4709d979f8960bcc0a">vtkAdjacentVertexIterator</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#c062f11f7ec184513ae7a81080a2b36c">vtkEdgeListIterator</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#2744f6fc766f81c1d302af20f9405e30">vtkInEdgeIterator</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#d0c885b5d9a21c4ffa8c3fac20b3a811">vtkOutEdgeIterator</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#7020850cc916c1e37ab7155179c92185">boost::vtk_edge_iterator</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#aaf5b83f5d037f154f43e8f3df18ffe5">boost::vtk_in_edge_pointer_iterator</a></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="a00654.html#b9be3d5f9da353087e37048a63b13052">boost::vtk_out_edge_pointer_iterator</a></td></tr>
</table>
<hr><h2>Member Typedef Documentation</h2>
<a class="anchor" name="331032de5dbbc39eedfb11ab11aa2273"></a><!-- doxytag: member="vtkGraph::Superclass" ref="331032de5dbbc39eedfb11ab11aa2273" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">typedef <a class="el" href="a00362.html">vtkDataObject</a> <a class="el" href="a00362.html">vtkGraph::Superclass</a> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
<p>Reimplemented from <a class="el" href="a00362.html#1cb1add9bd37d15f4dbf8e088e944e62">vtkDataObject</a>.</p>
<p>Reimplemented in <a class="el" href="a00420.html#39a5204245c63bd4cd11deb444bc226f">vtkDirectedAcyclicGraph</a>, <a class="el" href="a00421.html#1362fd74f1f00d5deced3a61e0d9dba5">vtkDirectedGraph</a>, <a class="el" href="a01071.html#7c98237e0bee9ebacb2e077fc5f81f7b">vtkMutableDirectedGraph</a>, <a class="el" href="a01073.html#1e9e4ae1818a6c58c312b58a94fc3be8">vtkMutableUndirectedGraph</a>, <a class="el" href="a01741.html#98a6078abee10b8074a41feb713cc6a4">vtkTree</a>, and <a class="el" href="a01776.html#341c630897e4eb7c6e0a4aa42d0f5a45">vtkUndirectedGraph</a>.</p>
<p>Definition at line <a class="el" href="a04053.html#l00285">285</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<hr><h2>Constructor & Destructor Documentation</h2>
<a class="anchor" name="c29576ea57baaf44ea57e472fe0126d5"></a><!-- doxytag: member="vtkGraph::vtkGraph" ref="c29576ea57baaf44ea57e472fe0126d5" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">vtkGraph::vtkGraph </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="e82c2a3d8713b3e7f580f234972a199c"></a><!-- doxytag: member="vtkGraph::~vtkGraph" ref="e82c2a3d8713b3e7f580f234972a199c" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">vtkGraph::~vtkGraph </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="2de90ef7c26974b67d9c096c2b83085d"></a><!-- doxytag: member="vtkGraph::GetClassName" ref="2de90ef7c26974b67d9c096c2b83085d" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual const char* vtkGraph::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="a00362.html#a1a6c049b32e772ce370fc5fafa67428">vtkDataObject</a>.</p>
<p>Reimplemented in <a class="el" href="a00420.html#f4daecd8c4c88f67b18ee0560bc2f0eb">vtkDirectedAcyclicGraph</a>, <a class="el" href="a00421.html#df0d7378551116bcdd19e79b69945420">vtkDirectedGraph</a>, <a class="el" href="a01071.html#35191c5f0bd0957e79e2300766135f6e">vtkMutableDirectedGraph</a>, <a class="el" href="a01073.html#145206ad25231e11b9f84d097464ebaf">vtkMutableUndirectedGraph</a>, <a class="el" href="a01741.html#04f932a1f7202806eaa9731d0ff529b7">vtkTree</a>, and <a class="el" href="a01776.html#3088a225c619f568f5e9d9d12ccefd6e">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="c5aea7669e34d666a29e5ae4e2e6a8dd"></a><!-- doxytag: member="vtkGraph::IsTypeOf" ref="c5aea7669e34d666a29e5ae4e2e6a8dd" args="(const char *type)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static int vtkGraph::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="a00362.html#0d0b43b6ab5a474eb8e97f47c43bae0e">vtkDataObject</a>.</p>
<p>Reimplemented in <a class="el" href="a00420.html#2b8f3bda72a7b3fba42f71a6ea49b93d">vtkDirectedAcyclicGraph</a>, <a class="el" href="a00421.html#b21534ad46d33209e3442b14da89c662">vtkDirectedGraph</a>, <a class="el" href="a01071.html#55ca0d0048bc71a271a360e86d04449a">vtkMutableDirectedGraph</a>, <a class="el" href="a01073.html#4e276f1e5b7c4fe213d0241122e98dcc">vtkMutableUndirectedGraph</a>, <a class="el" href="a01741.html#71f02719e85781896b6af82e522e3cd8">vtkTree</a>, and <a class="el" href="a01776.html#1d6361a1aa3ab983d916b6e547b8cb70">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="4bbe3c34b4c84d2a6fe4b8d16c7b3077"></a><!-- doxytag: member="vtkGraph::IsA" ref="4bbe3c34b4c84d2a6fe4b8d16c7b3077" args="(const char *type)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual int vtkGraph::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="a00362.html#79ea5a06ed7e8e192115a33f7384ed98">vtkDataObject</a>.</p>
<p>Reimplemented in <a class="el" href="a00420.html#a91160bdbf1c9387edd136ad35535312">vtkDirectedAcyclicGraph</a>, <a class="el" href="a00421.html#9948d9b33d0dd744ca30b06e2f9db26f">vtkDirectedGraph</a>, <a class="el" href="a01071.html#6f59bf2d82ac04c2be017427eb824578">vtkMutableDirectedGraph</a>, <a class="el" href="a01073.html#e1ecf774bcc5d671b17beaeb1d175fa9">vtkMutableUndirectedGraph</a>, <a class="el" href="a01741.html#8f661325aae048834784b90e47fb924c">vtkTree</a>, and <a class="el" href="a01776.html#f204c04a4d1a11ecf25896b96c1b012a">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="f88f7dd8a21d7b022f5f2c86107766f2"></a><!-- doxytag: member="vtkGraph::SafeDownCast" ref="f88f7dd8a21d7b022f5f2c86107766f2" args="(vtkObject *o)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static <a class="el" href="a00654.html">vtkGraph</a>* vtkGraph::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="a00362.html#8c6772e6b55033ce5833982eee01f8ef">vtkDataObject</a>.</p>
<p>Reimplemented in <a class="el" href="a00420.html#96ae39cd6c172a61f4f4a8ef8f2e3d4d">vtkDirectedAcyclicGraph</a>, <a class="el" href="a00421.html#1c8bf0c2b604d50756ae73f9a75f5c76">vtkDirectedGraph</a>, <a class="el" href="a01071.html#3974f284b4e0797211136cd71ca9d498">vtkMutableDirectedGraph</a>, <a class="el" href="a01073.html#5b7bd1a13fa3c0ee3b161c4413936943">vtkMutableUndirectedGraph</a>, <a class="el" href="a01741.html#f27f58415579b3b60600cd2ab36ce847">vtkTree</a>, and <a class="el" href="a01776.html#ebdb3a38772fd0fc436185079498f95b">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="97e1719f51cf2d0104e0718cfbb75b7b"></a><!-- doxytag: member="vtkGraph::PrintSelf" ref="97e1719f51cf2d0104e0718cfbb75b7b" args="(ostream &os, vtkIndent indent)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::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="a00362.html#41fc1279a91124320705e5fc98f623c7">vtkDataObject</a>.</p>
<p>Reimplemented in <a class="el" href="a00420.html#2a1fd1430a592fdd645b55b67ee6befc">vtkDirectedAcyclicGraph</a>, <a class="el" href="a00421.html#8178c7ac30bbd67bf7f6ce01b74ebd37">vtkDirectedGraph</a>, <a class="el" href="a01071.html#a125c55e74dc35d228c391d45ce28baa">vtkMutableDirectedGraph</a>, <a class="el" href="a01073.html#fab465ed1e01dea6f6ba769038ef1b28">vtkMutableUndirectedGraph</a>, <a class="el" href="a01741.html#7e736477e4f6bdefe2aa6c5c54e9f706">vtkTree</a>, and <a class="el" href="a01776.html#873e4dc6bc958d7f8b601448896d8fc5">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="3d093749e0e690e9154b1c6b52420462"></a><!-- doxytag: member="vtkGraph::GetVertexData" ref="3d093749e0e690e9154b1c6b52420462" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual <a class="el" href="a00376.html">vtkDataSetAttributes</a>* vtkGraph::GetVertexData </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Get the vertex or edge data.
</div>
</div><p>
<a class="anchor" name="0fb4eabd95c2bfa2c5ae12bbae6a4030"></a><!-- doxytag: member="vtkGraph::GetEdgeData" ref="0fb4eabd95c2bfa2c5ae12bbae6a4030" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual <a class="el" href="a00376.html">vtkDataSetAttributes</a>* vtkGraph::GetEdgeData </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Get the vertex or edge data.
</div>
</div><p>
<a class="anchor" name="7868f9ba271424ed385e436f48010deb"></a><!-- doxytag: member="vtkGraph::GetDataObjectType" ref="7868f9ba271424ed385e436f48010deb" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual int vtkGraph::GetDataObjectType </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [inline, virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return what type of dataset this is.
<p>Reimplemented from <a class="el" href="a00362.html#a29b32b4beac6a90d31d4751f427add7">vtkDataObject</a>.</p>
<p>Reimplemented in <a class="el" href="a00420.html#6067ea003c244299ed71f5c1fff22a80">vtkDirectedAcyclicGraph</a>, <a class="el" href="a00421.html#953eb3f7701142c27afa12ba74546700">vtkDirectedGraph</a>, <a class="el" href="a01741.html#33e3abe70bcac6d7297594f309648d52">vtkTree</a>, and <a class="el" href="a01776.html#aab0cc48d9e8fab32c7fee06cb20e69f">vtkUndirectedGraph</a>.</p>
<p>Definition at line <a class="el" href="a04053.html#l00295">295</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="bc291d25968a23e049ac507e5dc6321f"></a><!-- doxytag: member="vtkGraph::Initialize" ref="bc291d25968a23e049ac507e5dc6321f" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::Initialize </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Initialize to an empty graph.
<p>Reimplemented from <a class="el" href="a00362.html#125a61962658df7dd87d0c5755c06193">vtkDataObject</a>.</p>
</div>
</div><p>
<a class="anchor" name="b2f27329a4fab936f6afb1bc76205e1b"></a><!-- doxytag: member="vtkGraph::GetPoint" ref="b2f27329a4fab936f6afb1bc76205e1b" args="(vtkIdType ptId)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">double* vtkGraph::GetPoint </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>ptId</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
These methods return the point (0,0,0) until the points structure is created, when it returns the actual point position. In a distributed graph, only the points for local vertices can be retrieved.
</div>
</div><p>
<a class="anchor" name="e79de0b80b793423a142df1f2747bddf"></a><!-- doxytag: member="vtkGraph::GetPoint" ref="e79de0b80b793423a142df1f2747bddf" args="(vtkIdType ptId, double x[3])" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::GetPoint </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>ptId</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>[3]</td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
These methods return the point (0,0,0) until the points structure is created, when it returns the actual point position. In a distributed graph, only the points for local vertices can be retrieved.
</div>
</div><p>
<a class="anchor" name="8b7a79554d825719c5fd2b9dfd0e6173"></a><!-- doxytag: member="vtkGraph::GetPoints" ref="8b7a79554d825719c5fd2b9dfd0e6173" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a01250.html">vtkPoints</a>* vtkGraph::GetPoints </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Returns the points array for this graph. If points is not yet constructed, generates and returns a new points array filled with (0,0,0) coordinates. In a distributed graph, only the points for local vertices can be retrieved or modified.
</div>
</div><p>
<a class="anchor" name="9c09b2670e320b01483d09c2ddec6587"></a><!-- doxytag: member="vtkGraph::SetPoints" ref="9c09b2670e320b01483d09c2ddec6587" args="(vtkPoints *points)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::SetPoints </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01250.html">vtkPoints</a> * </td>
<td class="paramname"> <em>points</em> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Returns the points array for this graph. If points is not yet constructed, generates and returns a new points array filled with (0,0,0) coordinates. In a distributed graph, only the points for local vertices can be retrieved or modified.
</div>
</div><p>
<a class="anchor" name="18aca63b2f2ae0c5f86dee6e392481bd"></a><!-- doxytag: member="vtkGraph::ComputeBounds" ref="18aca63b2f2ae0c5f86dee6e392481bd" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::ComputeBounds </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Compute the bounds of the graph. In a distributed graph, this computes the bounds around the local part of the graph.
</div>
</div><p>
<a class="anchor" name="7e9fbd6cf12f49094905e2b769cdd2a9"></a><!-- doxytag: member="vtkGraph::GetBounds" ref="7e9fbd6cf12f49094905e2b769cdd2a9" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">double* vtkGraph::GetBounds </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return a pointer to the geometry bounding box in the form (xmin,xmax, ymin,ymax, zmin,zmax). In a distributed graph, this computes the bounds around the local part of the graph.
</div>
</div><p>
<a class="anchor" name="8bb412dff614c330fc21e86da3491d53"></a><!-- doxytag: member="vtkGraph::GetBounds" ref="8bb412dff614c330fc21e86da3491d53" args="(double bounds[6])" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::GetBounds </td>
<td>(</td>
<td class="paramtype">double </td>
<td class="paramname"> <em>bounds</em>[6] </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Return a pointer to the geometry bounding box in the form (xmin,xmax, ymin,ymax, zmin,zmax). In a distributed graph, this computes the bounds around the local part of the graph.
</div>
</div><p>
<a class="anchor" name="6cb44673db1ecdf1640124f6e21d18ad"></a><!-- doxytag: member="vtkGraph::GetMTime" ref="6cb44673db1ecdf1640124f6e21d18ad" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">unsigned long int vtkGraph::GetMTime </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The modified time of the graph.
<p>Reimplemented from <a class="el" href="a00362.html#6d307627fcb1696551ff404ac92a6dfc">vtkDataObject</a>.</p>
</div>
</div><p>
<a class="anchor" name="a9e590baa974a7fc0f601c8c7383fd3f"></a><!-- doxytag: member="vtkGraph::GetOutEdges" ref="a9e590baa974a7fc0f601c8c7383fd3f" args="(vtkIdType v, vtkOutEdgeIterator *it)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::GetOutEdges </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="a01137.html">vtkOutEdgeIterator</a> * </td>
<td class="paramname"> <em>it</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>
Initializes the out edge iterator to iterate over all outgoing edges of vertex v. For an undirected graph, returns all incident edges. In a distributed graph, the vertex v must be local to this processor.
</div>
</div><p>
<a class="anchor" name="ef5ab35e5db0684677108c2bb692ed03"></a><!-- doxytag: member="vtkGraph::GetDegree" ref="ef5ab35e5db0684677108c2bb692ed03" args="(vtkIdType v)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkGraph::GetDegree </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>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The total of all incoming and outgoing vertices for vertex v. For undirected graphs, this is simply the number of edges incident to v. In a distributed graph, the vertex v must be local to this processor.
</div>
</div><p>
<a class="anchor" name="0475d284ef47ef037c22bff52293e202"></a><!-- doxytag: member="vtkGraph::GetOutDegree" ref="0475d284ef47ef037c22bff52293e202" args="(vtkIdType v)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkGraph::GetOutDegree </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>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The number of outgoing edges from vertex v. For undirected graphs, returns the same as <a class="el" href="a00654.html#ef5ab35e5db0684677108c2bb692ed03">GetDegree()</a>. In a distributed graph, the vertex v must be local to this processor.
</div>
</div><p>
<a class="anchor" name="e03cadadf8da7c469b540dc2e8847c99"></a><!-- doxytag: member="vtkGraph::GetOutEdge" ref="e03cadadf8da7c469b540dc2e8847c99" args="(vtkIdType v, vtkIdType index)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual <a class="el" href="a01138.html">vtkOutEdgeType</a> vtkGraph::GetOutEdge </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="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>index</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>
Random-access method for retrieving outgoing edges from vertex v.
</div>
</div><p>
<a class="anchor" name="ae689207dc72ec6a0d26e0ff73ad411f"></a><!-- doxytag: member="vtkGraph::GetOutEdge" ref="ae689207dc72ec6a0d26e0ff73ad411f" args="(vtkIdType v, vtkIdType index, vtkGraphEdge *e)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::GetOutEdge </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="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>index</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00657.html">vtkGraphEdge</a> * </td>
<td class="paramname"> <em>e</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>
Random-access method for retrieving outgoing edges from vertex v. The method fills the <a class="el" href="a00657.html" title="Representation of a single graph edge.">vtkGraphEdge</a> instance with the id, source, and target of the edge. This method is provided for wrappers, <a class="el" href="a00654.html#e03cadadf8da7c469b540dc2e8847c99">GetOutEdge(vtkIdType, vtkIdType)</a> is preferred.
</div>
</div><p>
<a class="anchor" name="a1525c39b69a00be27f299293786d598"></a><!-- doxytag: member="vtkGraph::GetInEdges" ref="a1525c39b69a00be27f299293786d598" args="(vtkIdType v, vtkInEdgeIterator *it)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::GetInEdges </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="a00870.html">vtkInEdgeIterator</a> * </td>
<td class="paramname"> <em>it</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>
Initializes the in edge iterator to iterate over all incoming edges to vertex v. For an undirected graph, returns all incident edges. In a distributed graph, the vertex v must be local to this processor.
<p>Reimplemented in <a class="el" href="a01776.html#632e92f3997f76066b1be4689c67318f">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="d57b421461510206123401cbe49eea49"></a><!-- doxytag: member="vtkGraph::GetInDegree" ref="d57b421461510206123401cbe49eea49" args="(vtkIdType v)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkGraph::GetInDegree </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>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The number of incoming edges to vertex v. For undirected graphs, returns the same as <a class="el" href="a00654.html#ef5ab35e5db0684677108c2bb692ed03">GetDegree()</a>. In a distributed graph, the vertex v must be local to this processor.
<p>Reimplemented in <a class="el" href="a01776.html#21bb58f62dffb15bfbfd0a5fe8901a14">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="496ca01579222242644007c2ea4ec44d"></a><!-- doxytag: member="vtkGraph::GetInEdge" ref="496ca01579222242644007c2ea4ec44d" args="(vtkIdType v, vtkIdType index)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual <a class="el" href="a00871.html">vtkInEdgeType</a> vtkGraph::GetInEdge </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="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>index</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>
Random-access method for retrieving incoming edges to vertex v.
<p>Reimplemented in <a class="el" href="a01776.html#5a9320f4624b7ebe9816adf5ae6efdf3">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="243f075a7f74ad9a06928eba03324684"></a><!-- doxytag: member="vtkGraph::GetInEdge" ref="243f075a7f74ad9a06928eba03324684" args="(vtkIdType v, vtkIdType index, vtkGraphEdge *e)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::GetInEdge </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="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>index</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00657.html">vtkGraphEdge</a> * </td>
<td class="paramname"> <em>e</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>
Random-access method for retrieving incoming edges to vertex v. The method fills the <a class="el" href="a00657.html" title="Representation of a single graph edge.">vtkGraphEdge</a> instance with the id, source, and target of the edge. This method is provided for wrappers, <a class="el" href="a00654.html#496ca01579222242644007c2ea4ec44d">GetInEdge(vtkIdType, vtkIdType)</a> is preferred.
<p>Reimplemented in <a class="el" href="a01776.html#c6d5a8d57d62f310dc556e3f3b750be9">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="3d59262a08c72eebbdca9e9f8f7342ed"></a><!-- doxytag: member="vtkGraph::GetAdjacentVertices" ref="3d59262a08c72eebbdca9e9f8f7342ed" args="(vtkIdType v, vtkAdjacentVertexIterator *it)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::GetAdjacentVertices </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="a00097.html">vtkAdjacentVertexIterator</a> * </td>
<td class="paramname"> <em>it</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>
Initializes the adjacent vertex iterator to iterate over all outgoing vertices from vertex v. For an undirected graph, returns all adjacent vertices. In a distributed graph, the vertex v must be local to this processor.
</div>
</div><p>
<a class="anchor" name="c0a7e6cb62db04967ef3310159fa1da1"></a><!-- doxytag: member="vtkGraph::GetEdges" ref="c0a7e6cb62db04967ef3310159fa1da1" args="(vtkEdgeListIterator *it)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::GetEdges </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00450.html">vtkEdgeListIterator</a> * </td>
<td class="paramname"> <em>it</em> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Initializes the edge list iterator to iterate over all edges in the graph. Edges may not be traversed in order of increasing edge id. In a distributed graph, this returns edges that are stored locally.
</div>
</div><p>
<a class="anchor" name="c3534f310838e2303919825f0ec436ff"></a><!-- doxytag: member="vtkGraph::GetNumberOfEdges" ref="c3534f310838e2303919825f0ec436ff" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkGraph::GetNumberOfEdges </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The number of edges in the graph. In a distributed graph, this returns the number of edges stored locally.
</div>
</div><p>
<a class="anchor" name="eeed05aabf5e82e2fb934756482d9cf2"></a><!-- doxytag: member="vtkGraph::GetVertices" ref="eeed05aabf5e82e2fb934756482d9cf2" args="(vtkVertexListIterator *it)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::GetVertices </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a01826.html">vtkVertexListIterator</a> * </td>
<td class="paramname"> <em>it</em> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Initializes the vertex list iterator to iterate over all vertices in the graph. In a distributed graph, the iterator traverses all local vertices.
</div>
</div><p>
<a class="anchor" name="1acbb7b69387ec2a08956d1d9d11c679"></a><!-- doxytag: member="vtkGraph::GetNumberOfVertices" ref="1acbb7b69387ec2a08956d1d9d11c679" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual <a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkGraph::GetNumberOfVertices </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The number of vertices in the graph. In a distributed graph, returns the number of local vertices in the graph.
</div>
</div><p>
<a class="anchor" name="2f06360e1a493e0de0b7bea62dbabd31"></a><!-- doxytag: member="vtkGraph::SetDistributedGraphHelper" ref="2f06360e1a493e0de0b7bea62dbabd31" args="(vtkDistributedGraphHelper *helper)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::SetDistributedGraphHelper </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00433.html">vtkDistributedGraphHelper</a> * </td>
<td class="paramname"> <em>helper</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Sets the distributed graph helper of this graph, turning it into a distributed graph. This operation can only be executed on an empty graph.
</div>
</div><p>
<a class="anchor" name="09924a04ae4c4d22d621b65f237e6f22"></a><!-- doxytag: member="vtkGraph::GetDistributedGraphHelper" ref="09924a04ae4c4d22d621b65f237e6f22" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00433.html">vtkDistributedGraphHelper</a>* vtkGraph::GetDistributedGraphHelper </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Retrieves the distributed graph helper for this graph
</div>
</div><p>
<a class="anchor" name="4f596f7eae3b0583d799c92de472c14a"></a><!-- doxytag: member="vtkGraph::FindVertex" ref="4f596f7eae3b0583d799c92de472c14a" 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> vtkGraph::FindVertex </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>
Retrieve the vertex with the given pedigree ID. If successful, returns the ID of the vertex. Otherwise, either the vertex data does not have a pedigree ID array or there is no vertex with the given pedigree ID, so this function returns -1.
</div>
</div><p>
<a class="anchor" name="97cee6017324e9709f7dd41f51d3d7ae"></a><!-- doxytag: member="vtkGraph::ShallowCopy" ref="97cee6017324e9709f7dd41f51d3d7ae" args="(vtkDataObject *obj)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::ShallowCopy </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00362.html">vtkDataObject</a> * </td>
<td class="paramname"> <em>obj</em> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Shallow copies the data object into this graph. If it is an incompatible graph, reports an error.
<p>Reimplemented from <a class="el" href="a00362.html#04a5fb60bdbc929ce84f0cd14d911dbe">vtkDataObject</a>.</p>
</div>
</div><p>
<a class="anchor" name="b264c5c0dbaa400553abdc4aa6b6f02b"></a><!-- doxytag: member="vtkGraph::DeepCopy" ref="b264c5c0dbaa400553abdc4aa6b6f02b" args="(vtkDataObject *obj)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::DeepCopy </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00362.html">vtkDataObject</a> * </td>
<td class="paramname"> <em>obj</em> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Deep copies the data object into this graph. If it is an incompatible graph, reports an error.
<p>Reimplemented from <a class="el" href="a00362.html#455b17df288af545f40c3a013714f114">vtkDataObject</a>.</p>
</div>
</div><p>
<a class="anchor" name="89a368f963f530b5c162f274b1f5d356"></a><!-- doxytag: member="vtkGraph::CopyStructure" ref="89a368f963f530b5c162f274b1f5d356" args="(vtkGraph *g)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::CopyStructure </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00654.html">vtkGraph</a> * </td>
<td class="paramname"> <em>g</em> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Does a shallow copy of the topological information, but not the associated attributes.
</div>
</div><p>
<a class="anchor" name="93c80d654a851b754342cc0f81a4ad28"></a><!-- doxytag: member="vtkGraph::CheckedShallowCopy" ref="93c80d654a851b754342cc0f81a4ad28" args="(vtkGraph *g)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual bool vtkGraph::CheckedShallowCopy </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00654.html">vtkGraph</a> * </td>
<td class="paramname"> <em>g</em> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Performs the same operation as <a class="el" href="a00654.html#97cee6017324e9709f7dd41f51d3d7ae">ShallowCopy()</a>, but instead of reporting an error for an incompatible graph, returns false.
</div>
</div><p>
<a class="anchor" name="3733a589dd1446186715259671912b10"></a><!-- doxytag: member="vtkGraph::CheckedDeepCopy" ref="3733a589dd1446186715259671912b10" args="(vtkGraph *g)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual bool vtkGraph::CheckedDeepCopy </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00654.html">vtkGraph</a> * </td>
<td class="paramname"> <em>g</em> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Performs the same operation as <a class="el" href="a00654.html#b264c5c0dbaa400553abdc4aa6b6f02b">DeepCopy()</a>, but instead of reporting an error for an incompatible graph, returns false.
</div>
</div><p>
<a class="anchor" name="a07d16938b44caefac322d7bb31fcbc6"></a><!-- doxytag: member="vtkGraph::Squeeze" ref="a07d16938b44caefac322d7bb31fcbc6" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::Squeeze </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Reclaim unused memory.
</div>
</div><p>
<a class="anchor" name="82bd9f44771e77f1149af664e32b6614"></a><!-- doxytag: member="vtkGraph::GetData" ref="82bd9f44771e77f1149af664e32b6614" args="(vtkInformation *info)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static <a class="el" href="a00654.html">vtkGraph</a>* vtkGraph::GetData </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00872.html">vtkInformation</a> * </td>
<td class="paramname"> <em>info</em> </td>
<td> ) </td>
<td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Retrieve a graph from an information vector.
<p>Reimplemented from <a class="el" href="a00362.html#d7ebc4f6ec32a1db7e6cfc0ff6974559">vtkDataObject</a>.</p>
<p>Reimplemented in <a class="el" href="a00420.html#3d33ccf668b98e19f17b5d13bfce4d74">vtkDirectedAcyclicGraph</a>, <a class="el" href="a00421.html#f782474aed56e3b7cb971722fe1db1ce">vtkDirectedGraph</a>, <a class="el" href="a01741.html#2a9d6942adb887aff7d5b09c2d1c97b7">vtkTree</a>, and <a class="el" href="a01776.html#bdf206574397a71c9d648b97e7f30afc">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="d74f654e08be8838efa976d4f232d48d"></a><!-- doxytag: member="vtkGraph::GetData" ref="d74f654e08be8838efa976d4f232d48d" args="(vtkInformationVector *v, int i=0)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">static <a class="el" href="a00654.html">vtkGraph</a>* vtkGraph::GetData </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00895.html">vtkInformationVector</a> * </td>
<td class="paramname"> <em>v</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int </td>
<td class="paramname"> <em>i</em> = <code>0</code></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [static]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Retrieve a graph from an information vector.
<p>Reimplemented from <a class="el" href="a00362.html#67a5941517a1ac4702bb8a9dfb07e986">vtkDataObject</a>.</p>
<p>Reimplemented in <a class="el" href="a00420.html#bbf0e5bfeb99b3495de61cd88c7219a7">vtkDirectedAcyclicGraph</a>, <a class="el" href="a00421.html#b8fb2746e7292dafc27465a6f99b00e9">vtkDirectedGraph</a>, <a class="el" href="a01741.html#b04a9e220cf45b353720fc0dde9d8455">vtkTree</a>, and <a class="el" href="a01776.html#07aaed314283f97df7a0ca151963cc8b">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="ea360183fcdcec9cd228478db7c157fa"></a><!-- doxytag: member="vtkGraph::ReorderOutVertices" ref="ea360183fcdcec9cd228478db7c157fa" args="(vtkIdType v, vtkIdTypeArray *vertices)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::ReorderOutVertices </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="a00722.html">vtkIdTypeArray</a> * </td>
<td class="paramname"> <em>vertices</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Reorder the outgoing vertices of a vertex. The vertex list must have the same elements as the current out edge list, just in a different order. This method does not change the topology of the graph. In a distributed graph, the vertex v must be local.
</div>
</div><p>
<a class="anchor" name="6c213390ea94184af879c0ae03c0b5ba"></a><!-- doxytag: member="vtkGraph::IsSameStructure" ref="6c213390ea94184af879c0ae03c0b5ba" args="(vtkGraph *other)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool vtkGraph::IsSameStructure </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00654.html">vtkGraph</a> * </td>
<td class="paramname"> <em>other</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Returns true if both graphs point to the same adjacency structure. Can be used to test the copy-on-write feature of the graph.
</div>
</div><p>
<a class="anchor" name="a3f493a7a3166cb4b79254ee7958977d"></a><!-- doxytag: member="vtkGraph::GetSourceVertex" ref="a3f493a7a3166cb4b79254ee7958977d" args="(vtkIdType e)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkGraph::GetSourceVertex </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>e</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Retrieve the source and target vertices for an edge id. NOTE: The first time this is called, the graph will build a mapping array from edge id to source/target that is the same size as the number of edges in the graph. If you have access to a <a class="el" href="a01138.html">vtkOutEdgeType</a>, <a class="el" href="a00871.html">vtkInEdgeType</a>, <a class="el" href="a00454.html">vtkEdgeType</a>, or <a class="el" href="a00657.html" title="Representation of a single graph edge.">vtkGraphEdge</a>, you should directly use these structures to look up the source or target instead of this method.
</div>
</div><p>
<a class="anchor" name="66470b19c072ff80b56fa43cf1b97657"></a><!-- doxytag: member="vtkGraph::GetTargetVertex" ref="66470b19c072ff80b56fa43cf1b97657" args="(vtkIdType e)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkGraph::GetTargetVertex </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>e</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Retrieve the source and target vertices for an edge id. NOTE: The first time this is called, the graph will build a mapping array from edge id to source/target that is the same size as the number of edges in the graph. If you have access to a <a class="el" href="a01138.html">vtkOutEdgeType</a>, <a class="el" href="a00871.html">vtkInEdgeType</a>, <a class="el" href="a00454.html">vtkEdgeType</a>, or <a class="el" href="a00657.html" title="Representation of a single graph edge.">vtkGraphEdge</a>, you should directly use these structures to look up the source or target instead of this method.
</div>
</div><p>
<a class="anchor" name="1254b83e9bb7bc760e7d2a1dfce5312b"></a><!-- doxytag: member="vtkGraph::SetEdgePoints" ref="1254b83e9bb7bc760e7d2a1dfce5312b" args="(vtkIdType e, vtkIdType npts, double *pts)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::SetEdgePoints </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>e</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>npts</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double * </td>
<td class="paramname"> <em>pts</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Get/Set the internal edge control points associated with each edge. The size of the pts array is 3*npts, and holds the x,y,z location of each edge control point.
</div>
</div><p>
<a class="anchor" name="d5ea4853894fc82b089617cfd08e6556"></a><!-- doxytag: member="vtkGraph::GetEdgePoints" ref="d5ea4853894fc82b089617cfd08e6556" args="(vtkIdType e, vtkIdType &npts, double *&pts)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::GetEdgePoints </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>e</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>npts</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double *& </td>
<td class="paramname"> <em>pts</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Get/Set the internal edge control points associated with each edge. The size of the pts array is 3*npts, and holds the x,y,z location of each edge control point.
</div>
</div><p>
<a class="anchor" name="30d68a3592130d02631c05c7f94e8800"></a><!-- doxytag: member="vtkGraph::GetNumberOfEdgePoints" ref="30d68a3592130d02631c05c7f94e8800" args="(vtkIdType e)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> vtkGraph::GetNumberOfEdgePoints </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>e</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Get the number of edge points associated with an edge.
</div>
</div><p>
<a class="anchor" name="9c5cfe3e2963c651f8b55f1cb3ee1998"></a><!-- doxytag: member="vtkGraph::GetEdgePoint" ref="9c5cfe3e2963c651f8b55f1cb3ee1998" args="(vtkIdType e, vtkIdType i)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">double* vtkGraph::GetEdgePoint </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>e</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>i</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Get the x,y,z location of a point along edge e.
</div>
</div><p>
<a class="anchor" name="b28380ab612eb79637563398b0cdc6b6"></a><!-- doxytag: member="vtkGraph::ClearEdgePoints" ref="b28380ab612eb79637563398b0cdc6b6" args="(vtkIdType e)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::ClearEdgePoints </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>e</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Clear all points associated with an edge.
</div>
</div><p>
<a class="anchor" name="475c32209677496b6386abbf977bf553"></a><!-- doxytag: member="vtkGraph::SetEdgePoint" ref="475c32209677496b6386abbf977bf553" args="(vtkIdType e, vtkIdType i, double x[3])" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::SetEdgePoint </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>e</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>i</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>[3]</td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Set an x,y,z location of a point along an edge. This assumes there is already a point at location i, and simply overwrites it.
</div>
</div><p>
<a class="anchor" name="0adeb9bec97ca95749e27f24db6a0662"></a><!-- doxytag: member="vtkGraph::SetEdgePoint" ref="0adeb9bec97ca95749e27f24db6a0662" args="(vtkIdType e, vtkIdType i, double x, double y, double z)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::SetEdgePoint </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>e</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>i</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>y</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>z</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Set an x,y,z location of a point along an edge. This assumes there is already a point at location i, and simply overwrites it.
<p>Definition at line <a class="el" href="a04053.html#l00504">504</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="3189322874f507812ff37fd7a6a7534c"></a><!-- doxytag: member="vtkGraph::AddEdgePoint" ref="3189322874f507812ff37fd7a6a7534c" args="(vtkIdType e, double x[3])" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::AddEdgePoint </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>e</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>[3]</td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds a point to the end of the list of edge points for a certain edge.
</div>
</div><p>
<a class="anchor" name="0e34ca8be05868b70ea2b38aa35ec321"></a><!-- doxytag: member="vtkGraph::AddEdgePoint" ref="0e34ca8be05868b70ea2b38aa35ec321" args="(vtkIdType e, double x, double y, double z)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::AddEdgePoint </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a02149.html#20bd6b6dedfe1bbb096c50354d52cc7e">vtkIdType</a> </td>
<td class="paramname"> <em>e</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>x</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>y</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">double </td>
<td class="paramname"> <em>z</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [inline]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds a point to the end of the list of edge points for a certain edge.
<p>Definition at line <a class="el" href="a04053.html#l00512">512</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="c9bf8998049056a80168cbba7220372d"></a><!-- doxytag: member="vtkGraph::ShallowCopyEdgePoints" ref="c9bf8998049056a80168cbba7220372d" args="(vtkGraph *g)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::ShallowCopyEdgePoints </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00654.html">vtkGraph</a> * </td>
<td class="paramname"> <em>g</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Copy the internal edge point data from another graph into this graph. Both graphs must have the same number of edges.
</div>
</div><p>
<a class="anchor" name="a76953da30ceba0a2f72d91ce2d9dd9e"></a><!-- doxytag: member="vtkGraph::DeepCopyEdgePoints" ref="a76953da30ceba0a2f72d91ce2d9dd9e" args="(vtkGraph *g)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::DeepCopyEdgePoints </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00654.html">vtkGraph</a> * </td>
<td class="paramname"> <em>g</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Copy the internal edge point data from another graph into this graph. Both graphs must have the same number of edges.
</div>
</div><p>
<a class="anchor" name="97c9788eafce0d9eacf37cdae4cc601f"></a><!-- doxytag: member="vtkGraph::GetGraphInternals" ref="97c9788eafce0d9eacf37cdae4cc601f" args="(bool modifying)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00664.html">vtkGraphInternals</a>* vtkGraph::GetGraphInternals </td>
<td>(</td>
<td class="paramtype">bool </td>
<td class="paramname"> <em>modifying</em> </td>
<td> ) </td>
<td></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Returns the internal representation of the graph. If modifying is true, then the returned <a class="el" href="a00664.html" title="Internal representation of vtkGraph.">vtkGraphInternals</a> object will be unique to this <a class="el" href="a00654.html" title="Base class for graph data types.">vtkGraph</a> object.
</div>
</div><p>
<a class="anchor" name="09f9603e2a98f8966040dcbe50926d89"></a><!-- doxytag: member="vtkGraph::AddVertexInternal" ref="09f9603e2a98f8966040dcbe50926d89" args="(vtkVariantArray *propertyArr=0, vtkIdType *vertex=0)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::AddVertexInternal </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>
</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>vertex</em> = <code>0</code></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Protected method for adding vertices, optionally with properties, used by mutable subclasses. If vertex is non-null, it will be set to the newly-added (or found) vertex. Note that if propertyArr is non-null and the vertex data contains pedigree IDs, a vertex will only be added if there is no vertex with that pedigree ID.
</div>
</div><p>
<a class="anchor" name="2d9646fd560f463958a82a2d31137894"></a><!-- doxytag: member="vtkGraph::AddVertexInternal" ref="2d9646fd560f463958a82a2d31137894" args="(const vtkVariant &pedigree, vtkIdType *vertex)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::AddVertexInternal </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a01810.html">vtkVariant</a> & </td>
<td class="paramname"> <em>pedigree</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>vertex</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Adds a vertex with the given pedigree ID to the graph. If a vertex with this pedigree ID already exists, no new vertex is added, but the vertex argument is set to the ID of the existing vertex. Otherwise, a new vertex is added and its ID is provided.
</div>
</div><p>
<a class="anchor" name="bcadd2fa4848054349b58fa80b90bbeb"></a><!-- doxytag: member="vtkGraph::AddEdgeInternal" ref="bcadd2fa4848054349b58fa80b90bbeb" args="(vtkIdType u, vtkIdType v, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::AddEdgeInternal </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">bool </td>
<td class="paramname"> <em>directed</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>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00454.html">vtkEdgeType</a> * </td>
<td class="paramname"> <em>edge</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Protected method for adding edges of a certain directedness used by mutable subclasses. If propertyArr is non-null, it specifies the properties to be attached to the newly-created edge. If non-null, edge will receive the newly-added edge.
</div>
</div><p>
<a class="anchor" name="8066cd53558fea2b355de7026a24f78c"></a><!-- doxytag: member="vtkGraph::AddEdgeInternal" ref="8066cd53558fea2b355de7026a24f78c" args="(const vtkVariant &uPedigree, vtkIdType v, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::AddEdgeInternal </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a01810.html">vtkVariant</a> & </td>
<td class="paramname"> <em>uPedigree</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">bool </td>
<td class="paramname"> <em>directed</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>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00454.html">vtkEdgeType</a> * </td>
<td class="paramname"> <em>edge</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Protected method for adding edges of a certain directedness used by mutable subclasses. If propertyArr is non-null, it specifies the properties to be attached to the newly-created edge. If non-null, edge will receive the newly-added edge.
</div>
</div><p>
<a class="anchor" name="2c65d5df51387a9c2ca524de9f44f77a"></a><!-- doxytag: member="vtkGraph::AddEdgeInternal" ref="2c65d5df51387a9c2ca524de9f44f77a" args="(vtkIdType u, const vtkVariant &vPedigree, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::AddEdgeInternal </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>vPedigree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool </td>
<td class="paramname"> <em>directed</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>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00454.html">vtkEdgeType</a> * </td>
<td class="paramname"> <em>edge</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Protected method for adding edges of a certain directedness used by mutable subclasses. If propertyArr is non-null, it specifies the properties to be attached to the newly-created edge. If non-null, edge will receive the newly-added edge.
</div>
</div><p>
<a class="anchor" name="772762be5481f616d75c8e9527548a80"></a><!-- doxytag: member="vtkGraph::AddEdgeInternal" ref="772762be5481f616d75c8e9527548a80" args="(const vtkVariant &uPedigree, const vtkVariant &vPedigree, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::AddEdgeInternal </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="a01810.html">vtkVariant</a> & </td>
<td class="paramname"> <em>uPedigree</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>vPedigree</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool </td>
<td class="paramname"> <em>directed</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>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="a00454.html">vtkEdgeType</a> * </td>
<td class="paramname"> <em>edge</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Protected method for adding edges of a certain directedness used by mutable subclasses. If propertyArr is non-null, it specifies the properties to be attached to the newly-created edge. If non-null, edge will receive the newly-added edge.
</div>
</div><p>
<a class="anchor" name="fe7101c5c57cb394f5db409cba70a7c1"></a><!-- doxytag: member="vtkGraph::IsStructureValid" ref="fe7101c5c57cb394f5db409cba70a7c1" args="(vtkGraph *g)=0" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual bool vtkGraph::IsStructureValid </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00654.html">vtkGraph</a> * </td>
<td class="paramname"> <em>g</em> </td>
<td> ) </td>
<td><code> [protected, pure virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Subclasses override this method to accept the structure based on their requirements.
<p>Implemented in <a class="el" href="a00420.html#defa3f3a82faad5aa20697d3f492f235">vtkDirectedAcyclicGraph</a>, <a class="el" href="a00421.html#3cf57c77519fbbd9c2b64be69a9df095">vtkDirectedGraph</a>, <a class="el" href="a01741.html#1a8a2479b6fec93133d78ae411dd34bf">vtkTree</a>, and <a class="el" href="a01776.html#dd4cf5e4fe15ff94bf0b9c8523796a4b">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="8afc4412d4217619d9e0fdc0fe9c3864"></a><!-- doxytag: member="vtkGraph::CopyInternal" ref="8afc4412d4217619d9e0fdc0fe9c3864" args="(vtkGraph *g, bool deep)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::CopyInternal </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00654.html">vtkGraph</a> * </td>
<td class="paramname"> <em>g</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">bool </td>
<td class="paramname"> <em>deep</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [protected, virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Copy internal data structure.
</div>
</div><p>
<a class="anchor" name="bcc35a0263335e3bbd8bded228d5f4c4"></a><!-- doxytag: member="vtkGraph::SetInternals" ref="bcc35a0263335e3bbd8bded228d5f4c4" args="(vtkGraphInternals *internals)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::SetInternals </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00664.html">vtkGraphInternals</a> * </td>
<td class="paramname"> <em>internals</em> </td>
<td> ) </td>
<td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Private method for setting internals.
</div>
</div><p>
<a class="anchor" name="d11f6310e5e6cc9c94938f958e0ccec5"></a><!-- doxytag: member="vtkGraph::SetEdgePoints" ref="d11f6310e5e6cc9c94938f958e0ccec5" args="(vtkGraphEdgePoints *edgePoints)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::SetEdgePoints </td>
<td>(</td>
<td class="paramtype">vtkGraphEdgePoints * </td>
<td class="paramname"> <em>edgePoints</em> </td>
<td> ) </td>
<td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Private method for setting edge points.
</div>
</div><p>
<a class="anchor" name="2dc27e4f2d1eb13467b2c9be13f679ff"></a><!-- doxytag: member="vtkGraph::ForceOwnership" ref="2dc27e4f2d1eb13467b2c9be13f679ff" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::ForceOwnership </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
If this instance does not own its internals, it makes a copy of the internals. This is called before any write operation.
</div>
</div><p>
<a class="anchor" name="bccf244a6a9f6151a00157f6df54cbbf"></a><!-- doxytag: member="vtkGraph::GetOutEdges" ref="bccf244a6a9f6151a00157f6df54cbbf" args="(vtkIdType v, const vtkOutEdgeType *&edges, vtkIdType &nedges)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::GetOutEdges </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">const <a class="el" href="a01138.html">vtkOutEdgeType</a> *& </td>
<td class="paramname"> <em>edges</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>nedges</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [protected, virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Fast access functions for iterators.
</div>
</div><p>
<a class="anchor" name="aacdb2f91e0abffd896aadf57de18d31"></a><!-- doxytag: member="vtkGraph::GetInEdges" ref="aacdb2f91e0abffd896aadf57de18d31" args="(vtkIdType v, const vtkInEdgeType *&edges, vtkIdType &nedges)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::GetInEdges </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">const <a class="el" href="a00871.html">vtkInEdgeType</a> *& </td>
<td class="paramname"> <em>edges</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>nedges</em></td><td> </td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td><td><code> [protected, virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Fast access functions for iterators.
<p>Reimplemented in <a class="el" href="a01776.html#74a5cf6367834f5732e8466bebf9ae14">vtkUndirectedGraph</a>.</p>
</div>
</div><p>
<a class="anchor" name="1d0680df68a2335a26cad973b25d8b93"></a><!-- doxytag: member="vtkGraph::BuildEdgeList" ref="1d0680df68a2335a26cad973b25d8b93" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void vtkGraph::BuildEdgeList </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [protected]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Builds a mapping from edge id to source/target vertex id.
</div>
</div><p>
<a class="anchor" name="7d4479c717387a9da6548b5e1a5b43a7"></a><!-- doxytag: member="vtkGraph::GetEdgeList" ref="7d4479c717387a9da6548b5e1a5b43a7" args="()" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual <a class="el" href="a00722.html">vtkIdTypeArray</a>* vtkGraph::GetEdgeList </td>
<td>(</td>
<td class="paramname"> </td>
<td> ) </td>
<td><code> [protected, virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The optional mapping from edge id to source/target ids.
</div>
</div><p>
<a class="anchor" name="59db17843a299a648b8050d930dc0c6b"></a><!-- doxytag: member="vtkGraph::SetEdgeList" ref="59db17843a299a648b8050d930dc0c6b" args="(vtkIdTypeArray *list)" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">virtual void vtkGraph::SetEdgeList </td>
<td>(</td>
<td class="paramtype"><a class="el" href="a00722.html">vtkIdTypeArray</a> * </td>
<td class="paramname"> <em>list</em> </td>
<td> ) </td>
<td><code> [protected, virtual]</code></td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The optional mapping from edge id to source/target ids.
</div>
</div><p>
<hr><h2>Friends And Related Function Documentation</h2>
<a class="anchor" name="c862ef892503aa4709d979f8960bcc0a"></a><!-- doxytag: member="vtkGraph::vtkAdjacentVertexIterator" ref="c862ef892503aa4709d979f8960bcc0a" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">friend class <a class="el" href="a00097.html">vtkAdjacentVertexIterator</a><code> [friend]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Friend iterator classes. BTX
<p>Definition at line <a class="el" href="a04053.html#l00603">603</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="c062f11f7ec184513ae7a81080a2b36c"></a><!-- doxytag: member="vtkGraph::vtkEdgeListIterator" ref="c062f11f7ec184513ae7a81080a2b36c" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">friend class <a class="el" href="a00450.html">vtkEdgeListIterator</a><code> [friend]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Friend iterator classes. BTX
<p>Definition at line <a class="el" href="a04053.html#l00604">604</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="2744f6fc766f81c1d302af20f9405e30"></a><!-- doxytag: member="vtkGraph::vtkInEdgeIterator" ref="2744f6fc766f81c1d302af20f9405e30" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">friend class <a class="el" href="a00870.html">vtkInEdgeIterator</a><code> [friend]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Friend iterator classes. BTX
<p>Definition at line <a class="el" href="a04053.html#l00605">605</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="d0c885b5d9a21c4ffa8c3fac20b3a811"></a><!-- doxytag: member="vtkGraph::vtkOutEdgeIterator" ref="d0c885b5d9a21c4ffa8c3fac20b3a811" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">friend class <a class="el" href="a01137.html">vtkOutEdgeIterator</a><code> [friend]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Friend iterator classes. BTX
<p>Definition at line <a class="el" href="a04053.html#l00606">606</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="7020850cc916c1e37ab7155179c92185"></a><!-- doxytag: member="vtkGraph::boost::vtk_edge_iterator" ref="7020850cc916c1e37ab7155179c92185" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">friend class <a class="el" href="a00077.html">boost::vtk_edge_iterator</a><code> [friend]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Friend iterator classes. BTX
<p>Definition at line <a class="el" href="a04053.html#l00607">607</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="aaf5b83f5d037f154f43e8f3df18ffe5"></a><!-- doxytag: member="vtkGraph::boost::vtk_in_edge_pointer_iterator" ref="aaf5b83f5d037f154f43e8f3df18ffe5" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">friend class <a class="el" href="a00078.html">boost::vtk_in_edge_pointer_iterator</a><code> [friend]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Friend iterator classes. BTX
<p>Definition at line <a class="el" href="a04053.html#l00608">608</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="b9be3d5f9da353087e37048a63b13052"></a><!-- doxytag: member="vtkGraph::boost::vtk_out_edge_pointer_iterator" ref="b9be3d5f9da353087e37048a63b13052" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">friend class <a class="el" href="a00079.html">boost::vtk_out_edge_pointer_iterator</a><code> [friend]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Friend iterator classes. BTX
<p>Definition at line <a class="el" href="a04053.html#l00609">609</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<hr><h2>Member Data Documentation</h2>
<a class="anchor" name="bf733c990319949d9499d78da9c8e169"></a><!-- doxytag: member="vtkGraph::Internals" ref="bf733c990319949d9499d78da9c8e169" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00664.html">vtkGraphInternals</a>* <a class="el" href="a00654.html#bf733c990319949d9499d78da9c8e169">vtkGraph::Internals</a><code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The adjacency list internals of this graph.
<p>Definition at line <a class="el" href="a04053.html#l00574">574</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="a84e204a09598ef5cd9e33e3941003a7"></a><!-- doxytag: member="vtkGraph::DistributedHelper" ref="a84e204a09598ef5cd9e33e3941003a7" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00433.html">vtkDistributedGraphHelper</a>* <a class="el" href="a00654.html#a84e204a09598ef5cd9e33e3941003a7">vtkGraph::DistributedHelper</a><code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The distributed graph helper. Only non-NULL for distributed graphs.
<p>Definition at line <a class="el" href="a04053.html#l00577">577</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="65f95314935441297609daaeaa88d3ca"></a><!-- doxytag: member="vtkGraph::EdgePoints" ref="65f95314935441297609daaeaa88d3ca" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">vtkGraphEdgePoints* <a class="el" href="a00654.html#65f95314935441297609daaeaa88d3ca">vtkGraph::EdgePoints</a><code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The structure for holding the edge points.
<p>Definition at line <a class="el" href="a04053.html#l00583">583</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="3d251f46f35801c63a0338405d63c875"></a><!-- doxytag: member="vtkGraph::VertexData" ref="3d251f46f35801c63a0338405d63c875" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00376.html">vtkDataSetAttributes</a>* <a class="el" href="a00654.html#3d251f46f35801c63a0338405d63c875">vtkGraph::VertexData</a><code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The vertex and edge data.
<p>Definition at line <a class="el" href="a04053.html#l00615">615</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="d8dcf0fa3fc0e2291884e9d478a93d76"></a><!-- doxytag: member="vtkGraph::EdgeData" ref="d8dcf0fa3fc0e2291884e9d478a93d76" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00376.html">vtkDataSetAttributes</a>* <a class="el" href="a00654.html#d8dcf0fa3fc0e2291884e9d478a93d76">vtkGraph::EdgeData</a><code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The vertex and edge data.
<p>Definition at line <a class="el" href="a04053.html#l00616">616</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="fe87268ffc715120fce9c959e325badb"></a><!-- doxytag: member="vtkGraph::Bounds" ref="fe87268ffc715120fce9c959e325badb" args="[6]" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">double <a class="el" href="a00654.html#fe87268ffc715120fce9c959e325badb">vtkGraph::Bounds</a>[6]<code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
(xmin,xmax, ymin,ymax, zmin,zmax) geometric bounds.
<p>Definition at line <a class="el" href="a04053.html#l00620">620</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="20240c0ca7704bd42cbdb23bfd770f72"></a><!-- doxytag: member="vtkGraph::ComputeTime" ref="20240c0ca7704bd42cbdb23bfd770f72" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a01719.html">vtkTimeStamp</a> <a class="el" href="a00654.html#20240c0ca7704bd42cbdb23bfd770f72">vtkGraph::ComputeTime</a><code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
Time at which bounds were computed.
<p>Definition at line <a class="el" href="a04053.html#l00623">623</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="934a02a80bf067a488abc16fcc544d86"></a><!-- doxytag: member="vtkGraph::Points" ref="934a02a80bf067a488abc16fcc544d86" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a01250.html">vtkPoints</a>* <a class="el" href="a00654.html#934a02a80bf067a488abc16fcc544d86">vtkGraph::Points</a><code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The vertex locations.
<p>Definition at line <a class="el" href="a04053.html#l00627">627</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="fa6d615f17c6e8542b8616b9ff56565c"></a><!-- doxytag: member="vtkGraph::DefaultPoint" ref="fa6d615f17c6e8542b8616b9ff56565c" args="[3]" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">double <a class="el" href="a00654.html#fa6d615f17c6e8542b8616b9ff56565c">vtkGraph::DefaultPoint</a>[3]<code> [static, protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The vertex locations.
<p>Definition at line <a class="el" href="a04053.html#l00628">628</a> of file <a class="el" href="a04053.html">vtkGraph.h</a>.</p>
</div>
</div><p>
<a class="anchor" name="5d4f7f316c2d739cf2cede440bb69034"></a><!-- doxytag: member="vtkGraph::EdgeList" ref="5d4f7f316c2d739cf2cede440bb69034" args="" -->
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="a00722.html">vtkIdTypeArray</a>* <a class="el" href="a00654.html#5d4f7f316c2d739cf2cede440bb69034">vtkGraph::EdgeList</a><code> [protected]</code> </td>
</tr>
</table>
</div>
<div class="memdoc">
<p>
The optional mapping from edge id to source/target ids.
<p>Definition at line <a class="el" href="a04053.html#l00635">635</a> of file <a class="el" href="a04053.html">vtkGraph.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="a04053.html">vtkGraph.h</a></ul>
</div>
<hr size="1"><address style="text-align: right;"><small>Generated on Wed Jun 3 19:06:11 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
>
657
