VTK
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
Public Types | Public Member Functions | Static Public Member Functions | Protected Member Functions | List of all members
vtkBoostKruskalMinimumSpanningTree Class Reference

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

#include <vtkBoostKruskalMinimumSpanningTree.h>

Inherits vtkSelectionAlgorithm.

Public Types

typedef vtkSelectionAlgorithm Superclass
 

Public Member Functions

virtual int IsA (const char *type)
 
vtkBoostKruskalMinimumSpanningTreeNewInstance () const
 
void PrintSelf (ostream &os, vtkIndent indent)
 
virtual void SetEdgeWeightArrayName (const char *)
 
virtual void SetOutputSelectionType (const char *)
 
void SetNegateEdgeWeights (bool value)
 
virtual bool GetNegateEdgeWeights ()
 
virtual void NegateEdgeWeightsOn ()
 
virtual void NegateEdgeWeightsOff ()
 

Static Public Member Functions

static
vtkBoostKruskalMinimumSpanningTree
New ()
 
static int IsTypeOf (const char *type)
 
static
vtkBoostKruskalMinimumSpanningTree
SafeDownCast (vtkObjectBase *o)
 

Protected Member Functions

virtual vtkObjectBase * NewInstanceInternal () const
 
 vtkBoostKruskalMinimumSpanningTree ()
 
 ~vtkBoostKruskalMinimumSpanningTree ()
 
int RequestData (vtkInformation *, vtkInformationVector **, vtkInformationVector *)
 
int FillInputPortInformation (int port, vtkInformation *info)
 
int FillOutputPortInformation (int port, vtkInformation *info)
 

Detailed Description

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

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.

See Also
vtkGraph vtkBoostGraphAdapter
Examples:
vtkBoostKruskalMinimumSpanningTree (Examples)

Definition at line 46 of file vtkBoostKruskalMinimumSpanningTree.h.

Member Typedef Documentation

typedef vtkSelectionAlgorithm vtkBoostKruskalMinimumSpanningTree::Superclass

Definition at line 50 of file vtkBoostKruskalMinimumSpanningTree.h.

Constructor & Destructor Documentation

vtkBoostKruskalMinimumSpanningTree::vtkBoostKruskalMinimumSpanningTree ( )
protected
vtkBoostKruskalMinimumSpanningTree::~vtkBoostKruskalMinimumSpanningTree ( )
protected

Member Function Documentation

static vtkBoostKruskalMinimumSpanningTree* vtkBoostKruskalMinimumSpanningTree::New ( )
static
static int vtkBoostKruskalMinimumSpanningTree::IsTypeOf ( const char *  type)
static
virtual int vtkBoostKruskalMinimumSpanningTree::IsA ( const char *  type)
virtual
static vtkBoostKruskalMinimumSpanningTree* vtkBoostKruskalMinimumSpanningTree::SafeDownCast ( vtkObjectBase *  o)
static
virtual vtkObjectBase* vtkBoostKruskalMinimumSpanningTree::NewInstanceInternal ( ) const
protectedvirtual
vtkBoostKruskalMinimumSpanningTree* vtkBoostKruskalMinimumSpanningTree::NewInstance ( ) const
void vtkBoostKruskalMinimumSpanningTree::PrintSelf ( ostream &  os,
vtkIndent  indent 
)
virtual void vtkBoostKruskalMinimumSpanningTree::SetEdgeWeightArrayName ( const char *  )
virtual

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.

virtual void vtkBoostKruskalMinimumSpanningTree::SetOutputSelectionType ( const char *  )
virtual

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.

void vtkBoostKruskalMinimumSpanningTree::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 bool vtkBoostKruskalMinimumSpanningTree::GetNegateEdgeWeights ( )
virtual

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 vtkBoostKruskalMinimumSpanningTree::NegateEdgeWeightsOn ( )
virtual

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 vtkBoostKruskalMinimumSpanningTree::NegateEdgeWeightsOff ( )
virtual

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...

int vtkBoostKruskalMinimumSpanningTree::RequestData ( vtkInformation *  ,
vtkInformationVector **  ,
vtkInformationVector *   
)
protected
int vtkBoostKruskalMinimumSpanningTree::FillInputPortInformation ( int  port,
vtkInformation *  info 
)
protected
int vtkBoostKruskalMinimumSpanningTree::FillOutputPortInformation ( int  port,
vtkInformation *  info 
)
protected

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