ActiViz .NET
5.8.0
|
vtkGraph - Base class for graph data types. More...
Public Member Functions | |
vtkGraph (IntPtr rawCppThis, bool callDisposalMethod, bool strong) | |
Automatically generated constructor - called from generated code. DO NOT call directly. | |
void | AddEdgePoint (int e, IntPtr x) |
ETX. | |
void | AddEdgePoint (int e, double x, double y, double z) |
ETX. | |
virtual bool | CheckedDeepCopy (vtkGraph g) |
ETX. | |
virtual bool | CheckedShallowCopy (vtkGraph g) |
ETX. | |
void | ClearEdgePoints (int e) |
ETX. | |
void | ComputeBounds () |
Compute the bounds of the graph. In a distributed graph, this computes the bounds around the local part of the graph. | |
virtual void | CopyStructure (vtkGraph g) |
ETX. | |
override void | DeepCopy (vtkDataObject obj) |
ETX. | |
void | DeepCopyEdgePoints (vtkGraph g) |
ETX. | |
void | Dump () |
ETX. | |
virtual void | GetAdjacentVertices (int v, vtkAdjacentVertexIterator it) |
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. | |
override vtkFieldData | GetAttributesAsFieldData (int type) |
ETX. | |
IntPtr | GetBounds () |
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. | |
void | GetBounds (IntPtr bounds) |
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. | |
override int | GetDataObjectType () |
Return what type of dataset this is. | |
virtual int | GetDegree (int v) |
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. | |
vtkDistributedGraphHelper | GetDistributedGraphHelper () |
Retrieves the distributed graph helper for this graph. | |
virtual vtkDataSetAttributes | GetEdgeData () |
Get the vertex or edge data. | |
int | GetEdgeId (int a, int b) |
ETX. | |
double[] | GetEdgePoint (int e, int i) |
ETX. | |
virtual void | GetEdges (vtkEdgeListIterator it) |
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. | |
vtkGraphInternals | GetGraphInternals (bool modifying) |
ETX. | |
virtual int | GetInDegree (int v) |
The number of incoming edges to vertex v. For undirected graphs, returns the same as GetDegree(). In a distributed graph, the vertex v must be local to this processor. | |
virtual void | GetInEdge (int v, int index, vtkGraphEdge e) |
Random-access method for retrieving incoming edges to vertex v. The method fills the vtkGraphEdge instance with the id, source, and target of the edge. This method is provided for wrappers, GetInEdge(vtkIdType, vtkIdType) is preferred. | |
virtual void | GetInEdges (int v, vtkInEdgeIterator it) |
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. | |
void | GetInducedEdges (vtkIdTypeArray verts, vtkIdTypeArray edges) |
ETX. | |
override uint | GetMTime () |
The modified time of the graph. | |
int | GetNumberOfEdgePoints (int e) |
ETX. | |
virtual int | GetNumberOfEdges () |
The number of edges in the graph. In a distributed graph, this returns the number of edges stored locally. | |
override int | GetNumberOfElements (int type) |
ETX. | |
virtual int | GetNumberOfVertices () |
The number of vertices in the graph. In a distributed graph, returns the number of local vertices in the graph. | |
virtual int | GetOutDegree (int v) |
The number of outgoing edges from vertex v. For undirected graphs, returns the same as GetDegree(). In a distributed graph, the vertex v must be local to this processor. | |
virtual void | GetOutEdge (int v, int index, vtkGraphEdge e) |
Random-access method for retrieving outgoing edges from vertex v. The method fills the vtkGraphEdge instance with the id, source, and target of the edge. This method is provided for wrappers, GetOutEdge(vtkIdType, vtkIdType) is preferred. | |
virtual void | GetOutEdges (int v, vtkOutEdgeIterator it) |
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. | |
IntPtr | GetPoint (int ptId) |
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. | |
void | GetPoint (int ptId, IntPtr x) |
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. | |
vtkPoints | GetPoints () |
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. | |
int | GetSourceVertex (int e) |
ETX. | |
int | GetTargetVertex (int e) |
ETX. | |
virtual vtkDataSetAttributes | GetVertexData () |
Get the vertex or edge data. | |
virtual void | GetVertices (vtkVertexListIterator it) |
Initializes the vertex list iterator to iterate over all vertices in the graph. In a distributed graph, the iterator traverses all local vertices. | |
override void | Initialize () |
Initialize to an empty graph. | |
override int | IsA (string type) |
Undocumented Block. | |
bool | IsSameStructure (vtkGraph other) |
ETX. | |
new vtkGraph | NewInstance () |
Undocumented Block. | |
void | ReorderOutVertices (int v, vtkIdTypeArray vertices) |
ETX. | |
void | SetDistributedGraphHelper (vtkDistributedGraphHelper helper) |
BTX Sets the distributed graph helper of this graph, turning it into a distributed graph. This operation can only be executed on an empty graph. | |
void | SetEdgePoint (int e, int i, IntPtr x) |
ETX. | |
void | SetEdgePoint (int e, int i, double x, double y, double z) |
ETX. | |
void | SetEdgePoints (int e, int npts, IntPtr pts) |
ETX. | |
virtual void | SetPoints (vtkPoints points) |
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. | |
override void | ShallowCopy (vtkDataObject obj) |
ETX. | |
void | ShallowCopyEdgePoints (vtkGraph g) |
ETX. | |
virtual void | Squeeze () |
ETX. | |
bool | ToDirectedGraph (vtkDirectedGraph g) |
ETX. | |
bool | ToUndirectedGraph (vtkUndirectedGraph g) |
ETX. | |
Static Public Member Functions | |
static new vtkGraph | GetData (vtkInformation info) |
ETX. | |
static new vtkGraph | GetData (vtkInformationVector v, int i) |
ETX. | |
static new int | IsTypeOf (string type) |
Undocumented Block. | |
static new vtkGraph | SafeDownCast (vtkObjectBase o) |
Undocumented Block. | |
Public Attributes | |
new const string | MRFullTypeName = "Kitware.VTK.vtkGraph" |
Automatically generated type registration mechanics. | |
Static Public Attributes | |
static new readonly string | MRClassNameKey = "8vtkGraph" |
Automatically generated type registration mechanics. | |
Protected Member Functions | |
override void | Dispose (bool disposing) |
Automatically generated protected Dispose method - called from public Dispose or the C# destructor. DO NOT call directly. | |
Private Member Functions | |
static internal void | vtkGraph_AddEdgePoint_01 (HandleRef pThis, int e, IntPtr x) |
static internal void | vtkGraph_AddEdgePoint_02 (HandleRef pThis, int e, double x, double y, double z) |
static internal byte | vtkGraph_CheckedDeepCopy_03 (HandleRef pThis, HandleRef g) |
static internal byte | vtkGraph_CheckedShallowCopy_04 (HandleRef pThis, HandleRef g) |
static internal void | vtkGraph_ClearEdgePoints_05 (HandleRef pThis, int e) |
static internal void | vtkGraph_ComputeBounds_06 (HandleRef pThis) |
static internal void | vtkGraph_CopyStructure_07 (HandleRef pThis, HandleRef g) |
static internal void | vtkGraph_DeepCopy_08 (HandleRef pThis, HandleRef obj) |
static internal void | vtkGraph_DeepCopyEdgePoints_09 (HandleRef pThis, HandleRef g) |
static internal void | vtkGraph_Dump_10 (HandleRef pThis) |
static internal void | vtkGraph_GetAdjacentVertices_11 (HandleRef pThis, int v, HandleRef it) |
static internal IntPtr | vtkGraph_GetAttributesAsFieldData_12 (HandleRef pThis, int type, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount) |
static internal IntPtr | vtkGraph_GetBounds_13 (HandleRef pThis) |
static internal void | vtkGraph_GetBounds_14 (HandleRef pThis, IntPtr bounds) |
static internal IntPtr | vtkGraph_GetData_15 (HandleRef info, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount) |
static internal IntPtr | vtkGraph_GetData_16 (HandleRef v, int i, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount) |
static internal int | vtkGraph_GetDataObjectType_17 (HandleRef pThis) |
static internal int | vtkGraph_GetDegree_18 (HandleRef pThis, int v) |
static internal IntPtr | vtkGraph_GetDistributedGraphHelper_19 (HandleRef pThis, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount) |
static internal IntPtr | vtkGraph_GetEdgeData_20 (HandleRef pThis, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount) |
static internal int | vtkGraph_GetEdgeId_21 (HandleRef pThis, int a, int b) |
static internal IntPtr | vtkGraph_GetEdgePoint_22 (HandleRef pThis, int e, int i) |
static internal void | vtkGraph_GetEdges_23 (HandleRef pThis, HandleRef it) |
static internal IntPtr | vtkGraph_GetGraphInternals_24 (HandleRef pThis, byte modifying, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount) |
static internal int | vtkGraph_GetInDegree_25 (HandleRef pThis, int v) |
static internal void | vtkGraph_GetInEdge_26 (HandleRef pThis, int v, int index, HandleRef e) |
static internal void | vtkGraph_GetInEdges_27 (HandleRef pThis, int v, HandleRef it) |
static internal void | vtkGraph_GetInducedEdges_28 (HandleRef pThis, HandleRef verts, HandleRef edges) |
static internal uint | vtkGraph_GetMTime_29 (HandleRef pThis) |
static internal int | vtkGraph_GetNumberOfEdgePoints_30 (HandleRef pThis, int e) |
static internal int | vtkGraph_GetNumberOfEdges_31 (HandleRef pThis) |
static internal int | vtkGraph_GetNumberOfElements_32 (HandleRef pThis, int type) |
static internal int | vtkGraph_GetNumberOfVertices_33 (HandleRef pThis) |
static internal int | vtkGraph_GetOutDegree_34 (HandleRef pThis, int v) |
static internal void | vtkGraph_GetOutEdge_35 (HandleRef pThis, int v, int index, HandleRef e) |
static internal void | vtkGraph_GetOutEdges_36 (HandleRef pThis, int v, HandleRef it) |
static internal IntPtr | vtkGraph_GetPoint_37 (HandleRef pThis, int ptId) |
static internal void | vtkGraph_GetPoint_38 (HandleRef pThis, int ptId, IntPtr x) |
static internal IntPtr | vtkGraph_GetPoints_39 (HandleRef pThis, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount) |
static internal int | vtkGraph_GetSourceVertex_40 (HandleRef pThis, int e) |
static internal int | vtkGraph_GetTargetVertex_41 (HandleRef pThis, int e) |
static internal IntPtr | vtkGraph_GetVertexData_42 (HandleRef pThis, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount) |
static internal void | vtkGraph_GetVertices_43 (HandleRef pThis, HandleRef it) |
static internal void | vtkGraph_Initialize_44 (HandleRef pThis) |
static internal int | vtkGraph_IsA_45 (HandleRef pThis, string type) |
static internal byte | vtkGraph_IsSameStructure_46 (HandleRef pThis, HandleRef other) |
static internal int | vtkGraph_IsTypeOf_47 (string type) |
static internal IntPtr | vtkGraph_NewInstance_48 (HandleRef pThis, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount) |
static internal void | vtkGraph_ReorderOutVertices_49 (HandleRef pThis, int v, HandleRef vertices) |
static internal IntPtr | vtkGraph_SafeDownCast_50 (HandleRef o, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount) |
static internal void | vtkGraph_SetDistributedGraphHelper_51 (HandleRef pThis, HandleRef helper) |
static internal void | vtkGraph_SetEdgePoint_52 (HandleRef pThis, int e, int i, IntPtr x) |
static internal void | vtkGraph_SetEdgePoint_53 (HandleRef pThis, int e, int i, double x, double y, double z) |
static internal void | vtkGraph_SetEdgePoints_54 (HandleRef pThis, int e, int npts, IntPtr pts) |
static internal void | vtkGraph_SetPoints_55 (HandleRef pThis, HandleRef points) |
static internal void | vtkGraph_ShallowCopy_56 (HandleRef pThis, HandleRef obj) |
static internal void | vtkGraph_ShallowCopyEdgePoints_57 (HandleRef pThis, HandleRef g) |
static internal void | vtkGraph_Squeeze_58 (HandleRef pThis) |
static internal byte | vtkGraph_ToDirectedGraph_59 (HandleRef pThis, HandleRef g) |
static internal byte | vtkGraph_ToUndirectedGraph_60 (HandleRef pThis, HandleRef g) |
Static Private Member Functions | |
static | vtkGraph () |
Automatically generated type registration mechanics. |
vtkGraph - Base class for graph data types.
Description vtkGraph 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 vtkDirectedGraph subclass represents a graph whose edges have inherent order from source vertex to target vertex, while vtkUndirectedGraph is a graph whose edges have no inherent ordering.
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->GetNumberOfVertices() - 1. You may alternately create a vtkVertexListIterator 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.
Graph edges must be traversed through iterators. To traverse all edges in a graph, create an instance of vtkEdgeListIterator and call graph->GetEdges(it). it->Next() returns lightweight vtkEdgeType 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 vtkGraphEdge object, which has the same fields as vtkEdgeType accessible through getter methods.
To traverse all edges outgoing from a vertex, create a vtkOutEdgeIterator and call graph->GetOutEdges(v, it). it->Next() returns a lightweight vtkOutEdgeType containing the fields Id and Target. The source of the edge is always the vertex that was passed as an argument to GetOutEdges(). Incoming edges may be similarly traversed with vtkInEdgeIterator, which returns vtkInEdgeType structures with Id and Source fields. Both vtkOutEdgeIterator and vtkInEdgeIterator also provide the wrapper functions NextGraphEdge() which return vtkGraphEdge objects.
An additional iterator, vtkAdjacentVertexIterator can traverse outgoing vertices directly, instead needing to parse through edges. Initialize the iterator by calling graph->GetAdjacentVertices(v, it).
vtkGraph has two instances of vtkDataSetAttributes for associated vertex and edge data. It also has a vtkPoints instance which may store x,y,z locations for each vertex. This is populated by filters such as vtkGraphLayout and vtkAssignCoordinates.
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 vtkUndirectedGraph and vtkMutableUndirectedGraph may be shared directly. Structures from vtkDirectedGraph, vtkMutableDirectedGraph, and vtkTree may be shared directly with the exception that setting a structure to a tree requires that a "is a tree" test passes.
For graph types that are known to be compatible, calling ShallowCopy() or DeepCopy() will work as expected. When the outcome of a conversion is unknown (i.e. setting a graph to a tree), CheckedShallowCopy() and CheckedDeepCopy() exist which are identical to ShallowCopy() and DeepCopy(), 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.
To construct a graph, use vtkMutableDirectedGraph or vtkMutableUndirectedGraph. You may then use CheckedShallowCopy to set the contents of a mutable graph type into one of the non-mutable types vtkDirectedGraph, vtkUndirectedGraph. To construct a tree, use vtkMutableDirectedGraph, with directed edges which point from the parent to the child, then use CheckedShallowCopy to set the structure to a vtkTree.
Caveats 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.
Vertex pedigree IDs The vertices in a vtkGraph can be associated with pedigree IDs through GetVertexData()->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".
To configure the vtkGraph with a pedigree ID mapping, create a vtkDataArray that will store the pedigree IDs and set that array as the pedigree ID array for the vertices via GetVertexData()->SetPedigreeIds().
Distributed graphs
vtkGraph 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.
An empty vtkGraph can be made into a distributed graph by attaching an instance of a vtkDistributedGraphHelper via the SetDistributedGraphHelper() method. To determine whether a graph is distributed or not, call GetDistributedGraphHelper() 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 vtkInformation object (retrieved by GetInformation()) associated with the graph. Similarly, the value corresponding to the DATA_PIECE_NUMBER key of the vtkInformation object describes which piece of the data this graph instance provides.
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 vtkVertexListIterator produced by GetVertices(). GetNumberOfVertices(), 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 vtkGraph has been distributed. The local index will be a value between 0 and GetNumberOfVertices(), for vertices, or GetNumberOfEdges(), 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 vtkDistributedGraphHelper::GetVertexOwner() and the local index with vtkDistributedGraphHelper::GetVertexIndex(). With edges, the appropriate methods are vtkDistributedGraphHelper::GetEdgeOwner() and vtkDistributedGraphHelper::GetEdgeIndex(), respectively. To construct a vtkIdType representing either a vertex or edge given only its owner and local index, use vtkDistributedGraphHelper::MakeDistributedId().
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 GetVertices(), but may be encountered by traversing the in- and out-edge lists of local vertices or the edge list.
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 vtkDistributedGraphHelper::SetVertexPedigreeIdDistribution. 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.
static Kitware.VTK.vtkGraph.vtkGraph | ( | ) | [static, private] |
Automatically generated type registration mechanics.
Kitware.VTK.vtkGraph.vtkGraph | ( | IntPtr | rawCppThis, |
bool | callDisposalMethod, | ||
bool | strong | ||
) |
Automatically generated constructor - called from generated code. DO NOT call directly.
void Kitware.VTK.vtkGraph.AddEdgePoint | ( | int | e, |
IntPtr | x | ||
) |
ETX.
void Kitware.VTK.vtkGraph.AddEdgePoint | ( | int | e, |
double | x, | ||
double | y, | ||
double | z | ||
) |
ETX.
virtual bool Kitware.VTK.vtkGraph.CheckedDeepCopy | ( | vtkGraph | g | ) | [virtual] |
ETX.
virtual bool Kitware.VTK.vtkGraph.CheckedShallowCopy | ( | vtkGraph | g | ) | [virtual] |
ETX.
void Kitware.VTK.vtkGraph.ClearEdgePoints | ( | int | e | ) |
ETX.
void Kitware.VTK.vtkGraph.ComputeBounds | ( | ) |
Compute the bounds of the graph. In a distributed graph, this computes the bounds around the local part of the graph.
virtual void Kitware.VTK.vtkGraph.CopyStructure | ( | vtkGraph | g | ) | [virtual] |
ETX.
override void Kitware.VTK.vtkGraph.DeepCopy | ( | vtkDataObject | obj | ) | [virtual] |
ETX.
override void Kitware.VTK.vtkGraph.Dispose | ( | bool | disposing | ) | [protected] |
Automatically generated protected Dispose method - called from public Dispose or the C# destructor. DO NOT call directly.
Reimplemented from Kitware.VTK.vtkDataObject.
Reimplemented in Kitware.VTK.vtkReebGraph, Kitware.VTK.vtkDirectedAcyclicGraph, Kitware.VTK.vtkTree, Kitware.VTK.vtkUndirectedGraph, Kitware.VTK.vtkDirectedGraph, Kitware.VTK.vtkMutableDirectedGraph, and Kitware.VTK.vtkMutableUndirectedGraph.
void Kitware.VTK.vtkGraph.Dump | ( | ) |
ETX.
virtual void Kitware.VTK.vtkGraph.GetAdjacentVertices | ( | int | v, |
vtkAdjacentVertexIterator | it | ||
) | [virtual] |
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.
override vtkFieldData Kitware.VTK.vtkGraph.GetAttributesAsFieldData | ( | int | type | ) | [virtual] |
IntPtr Kitware.VTK.vtkGraph.GetBounds | ( | ) |
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.
void Kitware.VTK.vtkGraph.GetBounds | ( | IntPtr | bounds | ) |
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.
static new vtkGraph Kitware.VTK.vtkGraph.GetData | ( | vtkInformation | info | ) | [static] |
ETX.
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. If the graph is a distributed graph, this method will return the Distributed-ID of the vertex. vtkIdType FindVertex(const vtkVariant& pedigreeID);
Shallow copies the data object into this graph. If it is an incompatible graph, reports an error. virtual void ShallowCopy(vtkDataObject *obj);
Deep copies the data object into this graph. If it is an incompatible graph, reports an error. virtual void DeepCopy(vtkDataObject *obj);
Does a shallow copy of the topological information, but not the associated attributes. virtual void CopyStructure(vtkGraph *g);
Performs the same operation as ShallowCopy(), but instead of reporting an error for an incompatible graph, returns false. virtual bool CheckedShallowCopy(vtkGraph *g);
Performs the same operation as DeepCopy(), but instead of reporting an error for an incompatible graph, returns false. virtual bool CheckedDeepCopy(vtkGraph *g);
Reclaim unused memory. virtual void Squeeze();
BTX Retrieve a graph from an information vector.
Reimplemented from Kitware.VTK.vtkDataObject.
Reimplemented in Kitware.VTK.vtkTree, Kitware.VTK.vtkDirectedAcyclicGraph, Kitware.VTK.vtkUndirectedGraph, and Kitware.VTK.vtkDirectedGraph.
static new vtkGraph Kitware.VTK.vtkGraph.GetData | ( | vtkInformationVector | v, |
int | i | ||
) | [static] |
ETX.
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. If the graph is a distributed graph, this method will return the Distributed-ID of the vertex. vtkIdType FindVertex(const vtkVariant& pedigreeID);
Shallow copies the data object into this graph. If it is an incompatible graph, reports an error. virtual void ShallowCopy(vtkDataObject *obj);
Deep copies the data object into this graph. If it is an incompatible graph, reports an error. virtual void DeepCopy(vtkDataObject *obj);
Does a shallow copy of the topological information, but not the associated attributes. virtual void CopyStructure(vtkGraph *g);
Performs the same operation as ShallowCopy(), but instead of reporting an error for an incompatible graph, returns false. virtual bool CheckedShallowCopy(vtkGraph *g);
Performs the same operation as DeepCopy(), but instead of reporting an error for an incompatible graph, returns false. virtual bool CheckedDeepCopy(vtkGraph *g);
Reclaim unused memory. virtual void Squeeze();
BTX Retrieve a graph from an information vector.
Reimplemented from Kitware.VTK.vtkDataObject.
Reimplemented in Kitware.VTK.vtkTree, Kitware.VTK.vtkUndirectedGraph, Kitware.VTK.vtkDirectedAcyclicGraph, and Kitware.VTK.vtkDirectedGraph.
override int Kitware.VTK.vtkGraph.GetDataObjectType | ( | ) | [virtual] |
Return what type of dataset this is.
Reimplemented from Kitware.VTK.vtkDataObject.
Reimplemented in Kitware.VTK.vtkTree, Kitware.VTK.vtkUndirectedGraph, Kitware.VTK.vtkDirectedAcyclicGraph, and Kitware.VTK.vtkDirectedGraph.
virtual int Kitware.VTK.vtkGraph.GetDegree | ( | int | v | ) | [virtual] |
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.
Retrieves the distributed graph helper for this graph.
virtual vtkDataSetAttributes Kitware.VTK.vtkGraph.GetEdgeData | ( | ) | [virtual] |
Get the vertex or edge data.
int Kitware.VTK.vtkGraph.GetEdgeId | ( | int | a, |
int | b | ||
) |
ETX.
double [] Kitware.VTK.vtkGraph.GetEdgePoint | ( | int | e, |
int | i | ||
) |
ETX.
virtual void Kitware.VTK.vtkGraph.GetEdges | ( | vtkEdgeListIterator | it | ) | [virtual] |
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.
vtkGraphInternals Kitware.VTK.vtkGraph.GetGraphInternals | ( | bool | modifying | ) |
ETX.
virtual int Kitware.VTK.vtkGraph.GetInDegree | ( | int | v | ) | [virtual] |
The number of incoming edges to vertex v. For undirected graphs, returns the same as GetDegree(). In a distributed graph, the vertex v must be local to this processor.
Reimplemented in Kitware.VTK.vtkUndirectedGraph.
void Kitware.VTK.vtkGraph.GetInducedEdges | ( | vtkIdTypeArray | verts, |
vtkIdTypeArray | edges | ||
) |
ETX.
virtual void Kitware.VTK.vtkGraph.GetInEdge | ( | int | v, |
int | index, | ||
vtkGraphEdge | e | ||
) | [virtual] |
Random-access method for retrieving incoming edges to vertex v. The method fills the vtkGraphEdge instance with the id, source, and target of the edge. This method is provided for wrappers, GetInEdge(vtkIdType, vtkIdType) is preferred.
Reimplemented in Kitware.VTK.vtkUndirectedGraph.
virtual void Kitware.VTK.vtkGraph.GetInEdges | ( | int | v, |
vtkInEdgeIterator | it | ||
) | [virtual] |
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.
Reimplemented in Kitware.VTK.vtkUndirectedGraph.
override uint Kitware.VTK.vtkGraph.GetMTime | ( | ) | [virtual] |
The modified time of the graph.
Reimplemented from Kitware.VTK.vtkDataObject.
int Kitware.VTK.vtkGraph.GetNumberOfEdgePoints | ( | int | e | ) |
ETX.
virtual int Kitware.VTK.vtkGraph.GetNumberOfEdges | ( | ) | [virtual] |
The number of edges in the graph. In a distributed graph, this returns the number of edges stored locally.
override int Kitware.VTK.vtkGraph.GetNumberOfElements | ( | int | type | ) | [virtual] |
ETX.
Reimplemented from Kitware.VTK.vtkDataObject.
virtual int Kitware.VTK.vtkGraph.GetNumberOfVertices | ( | ) | [virtual] |
The number of vertices in the graph. In a distributed graph, returns the number of local vertices in the graph.
virtual int Kitware.VTK.vtkGraph.GetOutDegree | ( | int | v | ) | [virtual] |
The number of outgoing edges from vertex v. For undirected graphs, returns the same as GetDegree(). In a distributed graph, the vertex v must be local to this processor.
virtual void Kitware.VTK.vtkGraph.GetOutEdge | ( | int | v, |
int | index, | ||
vtkGraphEdge | e | ||
) | [virtual] |
Random-access method for retrieving outgoing edges from vertex v. The method fills the vtkGraphEdge instance with the id, source, and target of the edge. This method is provided for wrappers, GetOutEdge(vtkIdType, vtkIdType) is preferred.
virtual void Kitware.VTK.vtkGraph.GetOutEdges | ( | int | v, |
vtkOutEdgeIterator | it | ||
) | [virtual] |
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.
IntPtr Kitware.VTK.vtkGraph.GetPoint | ( | int | ptId | ) |
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.
void Kitware.VTK.vtkGraph.GetPoint | ( | int | ptId, |
IntPtr | x | ||
) |
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.
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.
int Kitware.VTK.vtkGraph.GetSourceVertex | ( | int | e | ) |
ETX.
int Kitware.VTK.vtkGraph.GetTargetVertex | ( | int | e | ) |
ETX.
virtual vtkDataSetAttributes Kitware.VTK.vtkGraph.GetVertexData | ( | ) | [virtual] |
Get the vertex or edge data.
virtual void Kitware.VTK.vtkGraph.GetVertices | ( | vtkVertexListIterator | it | ) | [virtual] |
Initializes the vertex list iterator to iterate over all vertices in the graph. In a distributed graph, the iterator traverses all local vertices.
override void Kitware.VTK.vtkGraph.Initialize | ( | ) | [virtual] |
Initialize to an empty graph.
Reimplemented from Kitware.VTK.vtkDataObject.
override int Kitware.VTK.vtkGraph.IsA | ( | string | type | ) | [virtual] |
Undocumented Block.
Reimplemented from Kitware.VTK.vtkDataObject.
Reimplemented in Kitware.VTK.vtkReebGraph, Kitware.VTK.vtkTree, Kitware.VTK.vtkMutableDirectedGraph, Kitware.VTK.vtkUndirectedGraph, Kitware.VTK.vtkDirectedAcyclicGraph, Kitware.VTK.vtkMutableUndirectedGraph, and Kitware.VTK.vtkDirectedGraph.
bool Kitware.VTK.vtkGraph.IsSameStructure | ( | vtkGraph | other | ) |
ETX.
static new int Kitware.VTK.vtkGraph.IsTypeOf | ( | string | type | ) | [static] |
Undocumented Block.
Reimplemented from Kitware.VTK.vtkDataObject.
Reimplemented in Kitware.VTK.vtkReebGraph, Kitware.VTK.vtkTree, Kitware.VTK.vtkUndirectedGraph, Kitware.VTK.vtkMutableDirectedGraph, Kitware.VTK.vtkDirectedGraph, Kitware.VTK.vtkDirectedAcyclicGraph, and Kitware.VTK.vtkMutableUndirectedGraph.
Undocumented Block.
Reimplemented from Kitware.VTK.vtkDataObject.
Reimplemented in Kitware.VTK.vtkReebGraph, Kitware.VTK.vtkMutableDirectedGraph, Kitware.VTK.vtkTree, Kitware.VTK.vtkMutableUndirectedGraph, Kitware.VTK.vtkUndirectedGraph, Kitware.VTK.vtkDirectedGraph, and Kitware.VTK.vtkDirectedAcyclicGraph.
void Kitware.VTK.vtkGraph.ReorderOutVertices | ( | int | v, |
vtkIdTypeArray | vertices | ||
) |
ETX.
static new vtkGraph Kitware.VTK.vtkGraph.SafeDownCast | ( | vtkObjectBase | o | ) | [static] |
Undocumented Block.
Reimplemented from Kitware.VTK.vtkDataObject.
Reimplemented in Kitware.VTK.vtkReebGraph, Kitware.VTK.vtkMutableDirectedGraph, Kitware.VTK.vtkMutableUndirectedGraph, Kitware.VTK.vtkTree, Kitware.VTK.vtkUndirectedGraph, Kitware.VTK.vtkDirectedGraph, and Kitware.VTK.vtkDirectedAcyclicGraph.
BTX Sets the distributed graph helper of this graph, turning it into a distributed graph. This operation can only be executed on an empty graph.
void Kitware.VTK.vtkGraph.SetEdgePoint | ( | int | e, |
int | i, | ||
IntPtr | x | ||
) |
ETX.
void Kitware.VTK.vtkGraph.SetEdgePoint | ( | int | e, |
int | i, | ||
double | x, | ||
double | y, | ||
double | z | ||
) |
ETX.
void Kitware.VTK.vtkGraph.SetEdgePoints | ( | int | e, |
int | npts, | ||
IntPtr | pts | ||
) |
ETX.
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. void ReorderOutVertices(vtkIdType v, vtkIdTypeArray *vertices);
Returns true if both graphs point to the same adjacency structure. Can be used to test the copy-on-write feature of the graph. bool IsSameStructure(vtkGraph *other);
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 vtkOutEdgeType, vtkInEdgeType, vtkEdgeType, or vtkGraphEdge, you should directly use these structures to look up the source or target instead of this method. vtkIdType GetSourceVertex(vtkIdType e); vtkIdType GetTargetVertex(vtkIdType e);
BTX 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.
virtual void Kitware.VTK.vtkGraph.SetPoints | ( | vtkPoints | points | ) | [virtual] |
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.
override void Kitware.VTK.vtkGraph.ShallowCopy | ( | vtkDataObject | obj | ) | [virtual] |
ETX.
Reimplemented from Kitware.VTK.vtkDataObject.
ETX.
virtual void Kitware.VTK.vtkGraph.Squeeze | ( | ) | [virtual] |
ETX.
ETX.
ETX.
static internal void Kitware.VTK.vtkGraph.vtkGraph_AddEdgePoint_01 | ( | HandleRef | pThis, |
int | e, | ||
IntPtr | x | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_AddEdgePoint_02 | ( | HandleRef | pThis, |
int | e, | ||
double | x, | ||
double | y, | ||
double | z | ||
) | [private] |
static internal byte Kitware.VTK.vtkGraph.vtkGraph_CheckedDeepCopy_03 | ( | HandleRef | pThis, |
HandleRef | g | ||
) | [private] |
static internal byte Kitware.VTK.vtkGraph.vtkGraph_CheckedShallowCopy_04 | ( | HandleRef | pThis, |
HandleRef | g | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_ClearEdgePoints_05 | ( | HandleRef | pThis, |
int | e | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_ComputeBounds_06 | ( | HandleRef | pThis | ) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_CopyStructure_07 | ( | HandleRef | pThis, |
HandleRef | g | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_DeepCopy_08 | ( | HandleRef | pThis, |
HandleRef | obj | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_DeepCopyEdgePoints_09 | ( | HandleRef | pThis, |
HandleRef | g | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_Dump_10 | ( | HandleRef | pThis | ) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_GetAdjacentVertices_11 | ( | HandleRef | pThis, |
int | v, | ||
HandleRef | it | ||
) | [private] |
static internal IntPtr Kitware.VTK.vtkGraph.vtkGraph_GetAttributesAsFieldData_12 | ( | HandleRef | pThis, |
int | type, | ||
ref uint | mteStatus, | ||
ref uint | mteIndex, | ||
ref uint | rawRefCount | ||
) | [private] |
static internal IntPtr Kitware.VTK.vtkGraph.vtkGraph_GetBounds_13 | ( | HandleRef | pThis | ) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_GetBounds_14 | ( | HandleRef | pThis, |
IntPtr | bounds | ||
) | [private] |
static internal IntPtr Kitware.VTK.vtkGraph.vtkGraph_GetData_15 | ( | HandleRef | info, |
ref uint | mteStatus, | ||
ref uint | mteIndex, | ||
ref uint | rawRefCount | ||
) | [private] |
static internal IntPtr Kitware.VTK.vtkGraph.vtkGraph_GetData_16 | ( | HandleRef | v, |
int | i, | ||
ref uint | mteStatus, | ||
ref uint | mteIndex, | ||
ref uint | rawRefCount | ||
) | [private] |
static internal int Kitware.VTK.vtkGraph.vtkGraph_GetDataObjectType_17 | ( | HandleRef | pThis | ) | [private] |
static internal int Kitware.VTK.vtkGraph.vtkGraph_GetDegree_18 | ( | HandleRef | pThis, |
int | v | ||
) | [private] |
static internal IntPtr Kitware.VTK.vtkGraph.vtkGraph_GetDistributedGraphHelper_19 | ( | HandleRef | pThis, |
ref uint | mteStatus, | ||
ref uint | mteIndex, | ||
ref uint | rawRefCount | ||
) | [private] |
static internal IntPtr Kitware.VTK.vtkGraph.vtkGraph_GetEdgeData_20 | ( | HandleRef | pThis, |
ref uint | mteStatus, | ||
ref uint | mteIndex, | ||
ref uint | rawRefCount | ||
) | [private] |
static internal int Kitware.VTK.vtkGraph.vtkGraph_GetEdgeId_21 | ( | HandleRef | pThis, |
int | a, | ||
int | b | ||
) | [private] |
static internal IntPtr Kitware.VTK.vtkGraph.vtkGraph_GetEdgePoint_22 | ( | HandleRef | pThis, |
int | e, | ||
int | i | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_GetEdges_23 | ( | HandleRef | pThis, |
HandleRef | it | ||
) | [private] |
static internal IntPtr Kitware.VTK.vtkGraph.vtkGraph_GetGraphInternals_24 | ( | HandleRef | pThis, |
byte | modifying, | ||
ref uint | mteStatus, | ||
ref uint | mteIndex, | ||
ref uint | rawRefCount | ||
) | [private] |
static internal int Kitware.VTK.vtkGraph.vtkGraph_GetInDegree_25 | ( | HandleRef | pThis, |
int | v | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_GetInducedEdges_28 | ( | HandleRef | pThis, |
HandleRef | verts, | ||
HandleRef | edges | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_GetInEdge_26 | ( | HandleRef | pThis, |
int | v, | ||
int | index, | ||
HandleRef | e | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_GetInEdges_27 | ( | HandleRef | pThis, |
int | v, | ||
HandleRef | it | ||
) | [private] |
static internal uint Kitware.VTK.vtkGraph.vtkGraph_GetMTime_29 | ( | HandleRef | pThis | ) | [private] |
static internal int Kitware.VTK.vtkGraph.vtkGraph_GetNumberOfEdgePoints_30 | ( | HandleRef | pThis, |
int | e | ||
) | [private] |
static internal int Kitware.VTK.vtkGraph.vtkGraph_GetNumberOfEdges_31 | ( | HandleRef | pThis | ) | [private] |
static internal int Kitware.VTK.vtkGraph.vtkGraph_GetNumberOfElements_32 | ( | HandleRef | pThis, |
int | type | ||
) | [private] |
static internal int Kitware.VTK.vtkGraph.vtkGraph_GetNumberOfVertices_33 | ( | HandleRef | pThis | ) | [private] |
static internal int Kitware.VTK.vtkGraph.vtkGraph_GetOutDegree_34 | ( | HandleRef | pThis, |
int | v | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_GetOutEdge_35 | ( | HandleRef | pThis, |
int | v, | ||
int | index, | ||
HandleRef | e | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_GetOutEdges_36 | ( | HandleRef | pThis, |
int | v, | ||
HandleRef | it | ||
) | [private] |
static internal IntPtr Kitware.VTK.vtkGraph.vtkGraph_GetPoint_37 | ( | HandleRef | pThis, |
int | ptId | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_GetPoint_38 | ( | HandleRef | pThis, |
int | ptId, | ||
IntPtr | x | ||
) | [private] |
static internal IntPtr Kitware.VTK.vtkGraph.vtkGraph_GetPoints_39 | ( | HandleRef | pThis, |
ref uint | mteStatus, | ||
ref uint | mteIndex, | ||
ref uint | rawRefCount | ||
) | [private] |
static internal int Kitware.VTK.vtkGraph.vtkGraph_GetSourceVertex_40 | ( | HandleRef | pThis, |
int | e | ||
) | [private] |
static internal int Kitware.VTK.vtkGraph.vtkGraph_GetTargetVertex_41 | ( | HandleRef | pThis, |
int | e | ||
) | [private] |
static internal IntPtr Kitware.VTK.vtkGraph.vtkGraph_GetVertexData_42 | ( | HandleRef | pThis, |
ref uint | mteStatus, | ||
ref uint | mteIndex, | ||
ref uint | rawRefCount | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_GetVertices_43 | ( | HandleRef | pThis, |
HandleRef | it | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_Initialize_44 | ( | HandleRef | pThis | ) | [private] |
static internal int Kitware.VTK.vtkGraph.vtkGraph_IsA_45 | ( | HandleRef | pThis, |
string | type | ||
) | [private] |
static internal byte Kitware.VTK.vtkGraph.vtkGraph_IsSameStructure_46 | ( | HandleRef | pThis, |
HandleRef | other | ||
) | [private] |
static internal int Kitware.VTK.vtkGraph.vtkGraph_IsTypeOf_47 | ( | string | type | ) | [private] |
static internal IntPtr Kitware.VTK.vtkGraph.vtkGraph_NewInstance_48 | ( | HandleRef | pThis, |
ref uint | mteStatus, | ||
ref uint | mteIndex, | ||
ref uint | rawRefCount | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_ReorderOutVertices_49 | ( | HandleRef | pThis, |
int | v, | ||
HandleRef | vertices | ||
) | [private] |
static internal IntPtr Kitware.VTK.vtkGraph.vtkGraph_SafeDownCast_50 | ( | HandleRef | o, |
ref uint | mteStatus, | ||
ref uint | mteIndex, | ||
ref uint | rawRefCount | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_SetDistributedGraphHelper_51 | ( | HandleRef | pThis, |
HandleRef | helper | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_SetEdgePoint_52 | ( | HandleRef | pThis, |
int | e, | ||
int | i, | ||
IntPtr | x | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_SetEdgePoint_53 | ( | HandleRef | pThis, |
int | e, | ||
int | i, | ||
double | x, | ||
double | y, | ||
double | z | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_SetEdgePoints_54 | ( | HandleRef | pThis, |
int | e, | ||
int | npts, | ||
IntPtr | pts | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_SetPoints_55 | ( | HandleRef | pThis, |
HandleRef | points | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_ShallowCopy_56 | ( | HandleRef | pThis, |
HandleRef | obj | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_ShallowCopyEdgePoints_57 | ( | HandleRef | pThis, |
HandleRef | g | ||
) | [private] |
static internal void Kitware.VTK.vtkGraph.vtkGraph_Squeeze_58 | ( | HandleRef | pThis | ) | [private] |
static internal byte Kitware.VTK.vtkGraph.vtkGraph_ToDirectedGraph_59 | ( | HandleRef | pThis, |
HandleRef | g | ||
) | [private] |
static internal byte Kitware.VTK.vtkGraph.vtkGraph_ToUndirectedGraph_60 | ( | HandleRef | pThis, |
HandleRef | g | ||
) | [private] |
new readonly string Kitware.VTK.vtkGraph.MRClassNameKey = "8vtkGraph" [static] |
Automatically generated type registration mechanics.
Reimplemented from Kitware.VTK.vtkDataObject.
Reimplemented in Kitware.VTK.vtkReebGraph, Kitware.VTK.vtkDirectedAcyclicGraph, Kitware.VTK.vtkTree, Kitware.VTK.vtkUndirectedGraph, Kitware.VTK.vtkDirectedGraph, Kitware.VTK.vtkMutableDirectedGraph, and Kitware.VTK.vtkMutableUndirectedGraph.
new const string Kitware.VTK.vtkGraph.MRFullTypeName = "Kitware.VTK.vtkGraph" |
Automatically generated type registration mechanics.
Reimplemented from Kitware.VTK.vtkDataObject.
Reimplemented in Kitware.VTK.vtkReebGraph, Kitware.VTK.vtkDirectedAcyclicGraph, Kitware.VTK.vtkTree, Kitware.VTK.vtkUndirectedGraph, Kitware.VTK.vtkDirectedGraph, Kitware.VTK.vtkMutableDirectedGraph, and Kitware.VTK.vtkMutableUndirectedGraph.