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.vtkBoostKruskalMinimumSpanningTree Class Reference

vtkBoostKruskalMinimumSpanningTree - Contructs a minimum spanning tree from a graph and the weighting array More...

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

List of all members.

Public Member Functions

 vtkBoostKruskalMinimumSpanningTree (IntPtr rawCppThis, bool callDisposalMethod, bool strong)
 Automatically generated constructor - called from generated code. DO NOT call directly.
 vtkBoostKruskalMinimumSpanningTree ()
 Undocumented Block.
virtual bool GetNegateEdgeWeights ()
 Whether to negate the edge weights. By negating the edge weights this algorithm will give you the 'maximal' spanning tree (i.e. the algorithm will try to create a spanning tree with the highest weighted edges). Defaulted to Off. FIXME: put a real definition in...
override int IsA (string type)
 Undocumented Block.
virtual void NegateEdgeWeightsOff ()
 Whether to negate the edge weights. By negating the edge weights this algorithm will give you the 'maximal' spanning tree (i.e. the algorithm will try to create a spanning tree with the highest weighted edges). Defaulted to Off. FIXME: put a real definition in...
virtual void NegateEdgeWeightsOn ()
 Whether to negate the edge weights. By negating the edge weights this algorithm will give you the 'maximal' spanning tree (i.e. the algorithm will try to create a spanning tree with the highest weighted edges). Defaulted to Off. FIXME: put a real definition in...
new
vtkBoostKruskalMinimumSpanningTree 
NewInstance ()
 Undocumented Block.
virtual void SetEdgeWeightArrayName (string _arg)
 Set the name of the edge-weight input array, which must name an array that is part of the edge data of the input graph and contains numeric data. If the edge-weight array is not of type vtkDoubleArray, the array will be copied into a temporary vtkDoubleArray.
void SetNegateEdgeWeights (bool value)
 Whether to negate the edge weights. By negating the edge weights this algorithm will give you the 'maximal' spanning tree (i.e. the algorithm will try to create a spanning tree with the highest weighted edges). Defaulted to Off. FIXME: put a real definition in...
virtual void SetOutputSelectionType (string _arg)
 Set the output selection type. The default is to use the the set of minimum spanning tree edges "MINIMUM_SPANNING_TREE_EDGES". No other options are defined.

Static Public Member Functions

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

Public Attributes

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

Static Public Attributes

static new readonly string MRClassNameKey = "34vtkBoostKruskalMinimumSpanningTree"
 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 vtkBoostKruskalMinimumSpanningTree_New (ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal byte vtkBoostKruskalMinimumSpanningTree_GetNegateEdgeWeights_01 (HandleRef pThis)
static internal int vtkBoostKruskalMinimumSpanningTree_IsA_02 (HandleRef pThis, string type)
static internal int vtkBoostKruskalMinimumSpanningTree_IsTypeOf_03 (string type)
static internal void vtkBoostKruskalMinimumSpanningTree_NegateEdgeWeightsOff_04 (HandleRef pThis)
static internal void vtkBoostKruskalMinimumSpanningTree_NegateEdgeWeightsOn_05 (HandleRef pThis)
static internal IntPtr vtkBoostKruskalMinimumSpanningTree_NewInstance_07 (HandleRef pThis, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal IntPtr vtkBoostKruskalMinimumSpanningTree_SafeDownCast_08 (HandleRef o, ref uint mteStatus, ref uint mteIndex, ref uint rawRefCount)
static internal void vtkBoostKruskalMinimumSpanningTree_SetEdgeWeightArrayName_09 (HandleRef pThis, string _arg)
static internal void vtkBoostKruskalMinimumSpanningTree_SetNegateEdgeWeights_10 (HandleRef pThis, byte value)
static internal void vtkBoostKruskalMinimumSpanningTree_SetOutputSelectionType_11 (HandleRef pThis, string _arg)

Static Private Member Functions

static vtkBoostKruskalMinimumSpanningTree ()
 Automatically generated type registration mechanics.

Detailed Description

vtkBoostKruskalMinimumSpanningTree - Contructs a minimum spanning tree from a graph and the weighting array

Description

This vtk class uses the Boost Kruskal Minimum Spanning Tree generic algorithm to perform a minimum spanning tree creation given a weighting value for each of the edges in the input graph.

vtkGraph vtkBoostGraphAdapter


Constructor & Destructor Documentation

Automatically generated type registration mechanics.

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

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

Undocumented Block.


Member Function Documentation

override void Kitware.VTK.vtkBoostKruskalMinimumSpanningTree.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.vtkSelectionAlgorithm.

Whether to negate the edge weights. By negating the edge weights this algorithm will give you the 'maximal' spanning tree (i.e. the algorithm will try to create a spanning tree with the highest weighted edges). Defaulted to Off. FIXME: put a real definition in...

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

Undocumented Block.

Reimplemented from Kitware.VTK.vtkSelectionAlgorithm.

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

Undocumented Block.

Reimplemented from Kitware.VTK.vtkSelectionAlgorithm.

Whether to negate the edge weights. By negating the edge weights this algorithm will give you the 'maximal' spanning tree (i.e. the algorithm will try to create a spanning tree with the highest weighted edges). Defaulted to Off. FIXME: put a real definition in...

Whether to negate the edge weights. By negating the edge weights this algorithm will give you the 'maximal' spanning tree (i.e. the algorithm will try to create a spanning tree with the highest weighted edges). Defaulted to Off. FIXME: put a real definition in...

Undocumented Block.

Reimplemented from Kitware.VTK.vtkSelectionAlgorithm.

Undocumented Block.

Reimplemented from Kitware.VTK.vtkSelectionAlgorithm.

Undocumented Block.

Reimplemented from Kitware.VTK.vtkSelectionAlgorithm.

Here is the call graph for this function:

Set the name of the edge-weight input array, which must name an array that is part of the edge data of the input graph and contains numeric data. If the edge-weight array is not of type vtkDoubleArray, the array will be copied into a temporary vtkDoubleArray.

Whether to negate the edge weights. By negating the edge weights this algorithm will give you the 'maximal' spanning tree (i.e. the algorithm will try to create a spanning tree with the highest weighted edges). Defaulted to Off. FIXME: put a real definition in...

Set the output selection type. The default is to use the the set of minimum spanning tree edges "MINIMUM_SPANNING_TREE_EDGES". No other options are defined.

static internal int Kitware.VTK.vtkBoostKruskalMinimumSpanningTree.vtkBoostKruskalMinimumSpanningTree_IsA_02 ( HandleRef  pThis,
string  type 
) [private]
static internal IntPtr Kitware.VTK.vtkBoostKruskalMinimumSpanningTree.vtkBoostKruskalMinimumSpanningTree_New ( ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal IntPtr Kitware.VTK.vtkBoostKruskalMinimumSpanningTree.vtkBoostKruskalMinimumSpanningTree_NewInstance_07 ( HandleRef  pThis,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal IntPtr Kitware.VTK.vtkBoostKruskalMinimumSpanningTree.vtkBoostKruskalMinimumSpanningTree_SafeDownCast_08 ( HandleRef  o,
ref uint  mteStatus,
ref uint  mteIndex,
ref uint  rawRefCount 
) [private]
static internal void Kitware.VTK.vtkBoostKruskalMinimumSpanningTree.vtkBoostKruskalMinimumSpanningTree_SetEdgeWeightArrayName_09 ( HandleRef  pThis,
string  _arg 
) [private]
static internal void Kitware.VTK.vtkBoostKruskalMinimumSpanningTree.vtkBoostKruskalMinimumSpanningTree_SetNegateEdgeWeights_10 ( HandleRef  pThis,
byte  value 
) [private]
static internal void Kitware.VTK.vtkBoostKruskalMinimumSpanningTree.vtkBoostKruskalMinimumSpanningTree_SetOutputSelectionType_11 ( HandleRef  pThis,
string  _arg 
) [private]

Member Data Documentation

new readonly string Kitware.VTK.vtkBoostKruskalMinimumSpanningTree.MRClassNameKey = "34vtkBoostKruskalMinimumSpanningTree" [static]

Automatically generated type registration mechanics.

Reimplemented from Kitware.VTK.vtkSelectionAlgorithm.

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

Automatically generated type registration mechanics.

Reimplemented from Kitware.VTK.vtkSelectionAlgorithm.


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