ActiViz .NET  5.8.0
Public Member Functions | Static Public Member Functions | Public Attributes | Static Public Attributes | Protected Member Functions | Private Member Functions | Static Private Member Functions
Kitware.VTK.vtkMutableDirectedGraph Class Reference

vtkMutableDirectedGraph - An editable directed graph. More...

Inheritance diagram for Kitware.VTK.vtkMutableDirectedGraph:
[legend]
Collaboration diagram for Kitware.VTK.vtkMutableDirectedGraph:
[legend]

List of all members.

Public Member Functions

 vtkMutableDirectedGraph (IntPtr rawCppThis, bool callDisposalMethod, bool strong)
 Automatically generated constructor - called from generated code. DO NOT call directly.
 vtkMutableDirectedGraph ()
 Undocumented Block.
int AddChild (int parent, vtkVariantArray propertyArr)
 Convenience method for creating trees. Returns the newly created vertex id. Shortcut for

       vtkIdType v = g->AddVertex();
       g->AddEdge(parent, v);

If non-null, propertyArr provides edge properties for the newly-created edge. The values in propertyArr must match up with the arrays in the edge data returned by GetEdgeData().

int AddChild (int parent)
 Convenience method for creating trees. Returns the newly created vertex id. Shortcut for

       vtkIdType v = g->AddVertex();
       g->AddEdge(parent, v);

If non-null, propertyArr provides edge properties for the newly-created edge. The values in propertyArr must match up with the arrays in the edge data returned by GetEdgeData().

vtkGraphEdge AddGraphEdge (int u, int v)
 Variant of AddEdge() that returns a heavyweight vtkGraphEdge object. The graph owns the reference of the edge and will replace its contents on the next call to AddGraphEdge().
int AddVertex ()
 Adds a vertex to the graph and returns the index of the new vertex.
int AddVertex (vtkVariantArray propertyArr)
 Adds a vertex to the graph with associated properties defined in propertyArr and returns the index of the new vertex. The number and order of values in propertyArr must match up with the arrays in the vertex data retrieved by GetVertexData().
override int IsA (string type)
 Undocumented Block.
void LazyAddEdge (int u, int v, vtkVariantArray propertyArr)
 Adds a directed edge from u to v, where u and v are vertex indices.
void LazyAddVertex ()
 Adds a vertex to the graph.
void LazyAddVertex (vtkVariantArray propertyArr)
 Adds a vertex to the graph with associated properties defined in propertyArr. The number and order of values in propertyArr must match up with the arrays in the vertex data retrieved by GetVertexData().
new vtkMutableDirectedGraph NewInstance ()
 Undocumented Block.
void RemoveEdge (int e)
 Removes the edge from the graph. Note: This invalidates the last edge index, which is reassigned to e.
void RemoveEdges (vtkIdTypeArray arr)
 Removes a collection of edges from the graph.
void RemoveVertex (int v)
 Removes the vertex from the graph along with any connected edges. Note: This invalidates the last vertex index, which is reassigned to v.
void RemoveVertices (vtkIdTypeArray arr)
 Removes a collection of vertices from the graph along with any connected edges.
virtual int SetNumberOfVertices (int numVerts)
 Allocates space for the specified number of vertices in the graph's internal data structures.

Static Public Member Functions

static new vtkMutableDirectedGraph New ()
 Undocumented Block.
static new int IsTypeOf (string type)
 Undocumented Block.
static new vtkMutableDirectedGraph SafeDownCast (vtkObjectBase o)
 Undocumented Block.

Public Attributes

new const string MRFullTypeName = "Kitware.VTK.vtkMutableDirectedGraph"
 Automatically generated type registration mechanics.

Static Public Attributes

static new readonly string MRClassNameKey = "23vtkMutableDirectedGraph"
 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 IntPtr vtkMutableDirectedGraph_New (ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal int vtkMutableDirectedGraph_AddChild_01 (HandleRef pThis, int parent, HandleRef propertyArr)
static internal int vtkMutableDirectedGraph_AddChild_02 (HandleRef pThis, int parent)
static internal IntPtr vtkMutableDirectedGraph_AddGraphEdge_03 (HandleRef pThis, int u, int v, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal int vtkMutableDirectedGraph_AddVertex_04 (HandleRef pThis)
static internal int vtkMutableDirectedGraph_AddVertex_05 (HandleRef pThis, HandleRef propertyArr)
static internal int vtkMutableDirectedGraph_IsA_06 (HandleRef pThis, string type)
static internal int vtkMutableDirectedGraph_IsTypeOf_07 (string type)
static internal void vtkMutableDirectedGraph_LazyAddEdge_08 (HandleRef pThis, int u, int v, HandleRef propertyArr)
static internal void vtkMutableDirectedGraph_LazyAddVertex_09 (HandleRef pThis)
static internal void vtkMutableDirectedGraph_LazyAddVertex_10 (HandleRef pThis, HandleRef propertyArr)
static internal IntPtr vtkMutableDirectedGraph_NewInstance_12 (HandleRef pThis, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal void vtkMutableDirectedGraph_RemoveEdge_13 (HandleRef pThis, int e)
static internal void vtkMutableDirectedGraph_RemoveEdges_14 (HandleRef pThis, HandleRef arr)
static internal void vtkMutableDirectedGraph_RemoveVertex_15 (HandleRef pThis, int v)
static internal void vtkMutableDirectedGraph_RemoveVertices_16 (HandleRef pThis, HandleRef arr)
static internal IntPtr vtkMutableDirectedGraph_SafeDownCast_17 (HandleRef o, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal int vtkMutableDirectedGraph_SetNumberOfVertices_18 (HandleRef pThis, int numVerts)

Static Private Member Functions

static vtkMutableDirectedGraph ()
 Automatically generated type registration mechanics.

Detailed Description

vtkMutableDirectedGraph - An editable directed graph.

Description vtkMutableDirectedGraph is a directed graph which has additional methods for adding edges and vertices. AddChild() is a convenience method for constructing trees. ShallowCopy(), DeepCopy(), CheckedShallowCopy() and CheckedDeepCopy() will succeed for instances of vtkDirectedGraph, vtkMutableDirectedGraph and vtkTree.

vtkDirectedGraph vtkGraph vtkTree


Constructor & Destructor Documentation

Automatically generated type registration mechanics.

Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph ( IntPtr  rawCppThis,
bool  callDisposalMethod,
bool  strong 
)

Automatically generated constructor - called from generated code. DO NOT call directly.

Undocumented Block.


Member Function Documentation

int Kitware.VTK.vtkMutableDirectedGraph.AddChild ( int  parent,
vtkVariantArray  propertyArr 
)

Convenience method for creating trees. Returns the newly created vertex id. Shortcut for

       vtkIdType v = g->AddVertex();
       g->AddEdge(parent, v);

If non-null, propertyArr provides edge properties for the newly-created edge. The values in propertyArr must match up with the arrays in the edge data returned by GetEdgeData().

Convenience method for creating trees. Returns the newly created vertex id. Shortcut for

       vtkIdType v = g->AddVertex();
       g->AddEdge(parent, v);

If non-null, propertyArr provides edge properties for the newly-created edge. The values in propertyArr must match up with the arrays in the edge data returned by GetEdgeData().

Variant of AddEdge() that returns a heavyweight vtkGraphEdge object. The graph owns the reference of the edge and will replace its contents on the next call to AddGraphEdge().

Note:
This is a less efficient method for use with wrappers. In C++ you should use the faster AddEdge().

Here is the call graph for this function:

Adds a vertex to the graph and returns the index of the new vertex.

Note:
In a distributed graph (i.e. a graph whose DistributedHelper is non-null), this routine cannot be used to add a vertex if the vertices in the graph have pedigree IDs, because this routine will always add the vertex locally, which may conflict with the proper location of the vertex based on the distribution of the pedigree IDs.

Adds a vertex to the graph with associated properties defined in propertyArr and returns the index of the new vertex. The number and order of values in propertyArr must match up with the arrays in the vertex data retrieved by GetVertexData().

If a vertex with the given pedigree ID already exists, its properties will be overwritten with the properties in propertyArr and the existing vertex index will be returned.

Note:
In a distributed graph (i.e. a graph whose DistributedHelper is non-null) the vertex added or found might not be local. In this case, AddVertex will wait until the vertex can be added or found remotely, so that the proper vertex index can be returned. If you don't actually need to use the vertex index, consider calling LazyAddVertex, which provides better performance by eliminating the delays associated with returning the vertex index.
override void Kitware.VTK.vtkMutableDirectedGraph.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.vtkDirectedGraph.

Reimplemented in Kitware.VTK.vtkReebGraph.

override int Kitware.VTK.vtkMutableDirectedGraph.IsA ( string  type) [virtual]

Undocumented Block.

Reimplemented from Kitware.VTK.vtkDirectedGraph.

Reimplemented in Kitware.VTK.vtkReebGraph.

static new int Kitware.VTK.vtkMutableDirectedGraph.IsTypeOf ( string  type) [static]

Undocumented Block.

Reimplemented from Kitware.VTK.vtkDirectedGraph.

Reimplemented in Kitware.VTK.vtkReebGraph.

void Kitware.VTK.vtkMutableDirectedGraph.LazyAddEdge ( int  u,
int  v,
vtkVariantArray  propertyArr 
)

Adds a directed edge from u to v, where u and v are vertex indices.

The number and order of values in the optional parameter propertyArr must match up with the arrays in the edge data retrieved by GetEdgeData().

This method is lazily evaluated for distributed graphs (i.e. graphs whose DistributedHelper is non-null) the next time Synchronize is called on the helper.

Adds a vertex to the graph.

This method is lazily evaluated for distributed graphs (i.e. graphs whose DistributedHelper is non-null) the next time Synchronize is called on the helper.

Adds a vertex to the graph with associated properties defined in propertyArr. The number and order of values in propertyArr must match up with the arrays in the vertex data retrieved by GetVertexData().

If a vertex with the given pedigree ID already exists, its properties will be overwritten with the properties in propertyArr.

This method is lazily evaluated for distributed graphs (i.e. graphs whose DistributedHelper is non-null) the next time Synchronize is called on the helper.

Undocumented Block.

Reimplemented from Kitware.VTK.vtkDirectedGraph.

Reimplemented in Kitware.VTK.vtkReebGraph.

Undocumented Block.

Reimplemented from Kitware.VTK.vtkDirectedGraph.

Reimplemented in Kitware.VTK.vtkReebGraph.

Removes the edge from the graph. Note: This invalidates the last edge index, which is reassigned to e.

Removes a collection of edges from the graph.

Removes the vertex from the graph along with any connected edges. Note: This invalidates the last vertex index, which is reassigned to v.

Removes a collection of vertices from the graph along with any connected edges.

Undocumented Block.

Reimplemented from Kitware.VTK.vtkDirectedGraph.

Reimplemented in Kitware.VTK.vtkReebGraph.

Here is the call graph for this function:

virtual int Kitware.VTK.vtkMutableDirectedGraph.SetNumberOfVertices ( int  numVerts) [virtual]

Allocates space for the specified number of vertices in the graph's internal data structures.

This has no effect on the number of vertex coordinate tuples or vertex attribute tuples allocated; you are responsible for guaranteeing these match. Also, this call is not implemented for distributed-memory graphs since the semantics are unclear; calling this function on a graph with a non-NULL DistributedGraphHelper will generate an error message and no allocation will be performed.

static internal int Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_AddChild_01 ( HandleRef  pThis,
int  parent,
HandleRef  propertyArr 
) [private]
static internal int Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_AddChild_02 ( HandleRef  pThis,
int  parent 
) [private]
static internal IntPtr Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_AddGraphEdge_03 ( HandleRef  pThis,
int  u,
int  v,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal int Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_AddVertex_04 ( HandleRef  pThis) [private]
static internal int Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_AddVertex_05 ( HandleRef  pThis,
HandleRef  propertyArr 
) [private]
static internal int Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_IsA_06 ( HandleRef  pThis,
string  type 
) [private]
static internal int Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_IsTypeOf_07 ( string  type) [private]
static internal void Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_LazyAddEdge_08 ( HandleRef  pThis,
int  u,
int  v,
HandleRef  propertyArr 
) [private]
static internal void Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_LazyAddVertex_09 ( HandleRef  pThis) [private]
static internal void Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_LazyAddVertex_10 ( HandleRef  pThis,
HandleRef  propertyArr 
) [private]
static internal IntPtr Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_New ( ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal IntPtr Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_NewInstance_12 ( HandleRef  pThis,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal void Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_RemoveEdge_13 ( HandleRef  pThis,
int  e 
) [private]
static internal void Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_RemoveEdges_14 ( HandleRef  pThis,
HandleRef  arr 
) [private]
static internal void Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_RemoveVertex_15 ( HandleRef  pThis,
int  v 
) [private]
static internal void Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_RemoveVertices_16 ( HandleRef  pThis,
HandleRef  arr 
) [private]
static internal IntPtr Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_SafeDownCast_17 ( HandleRef  o,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal int Kitware.VTK.vtkMutableDirectedGraph.vtkMutableDirectedGraph_SetNumberOfVertices_18 ( HandleRef  pThis,
int  numVerts 
) [private]

Member Data Documentation

new readonly string Kitware.VTK.vtkMutableDirectedGraph.MRClassNameKey = "23vtkMutableDirectedGraph" [static]

Automatically generated type registration mechanics.

Reimplemented from Kitware.VTK.vtkDirectedGraph.

Reimplemented in Kitware.VTK.vtkReebGraph.

new const string Kitware.VTK.vtkMutableDirectedGraph.MRFullTypeName = "Kitware.VTK.vtkMutableDirectedGraph"

Automatically generated type registration mechanics.

Reimplemented from Kitware.VTK.vtkDirectedGraph.

Reimplemented in Kitware.VTK.vtkReebGraph.


The documentation for this class was generated from the following file: