Contructs a minimum spanning tree from a graph and the weighting array.
More...
#include <vtkBoostKruskalMinimumSpanningTree.h>
Inherits vtkSelectionAlgorithm.
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.
vtkBoostKruskalMinimumSpanningTree::vtkBoostKruskalMinimumSpanningTree |
( |
| ) |
|
|
protected |
vtkBoostKruskalMinimumSpanningTree::~vtkBoostKruskalMinimumSpanningTree |
( |
| ) |
|
|
protected |
static int vtkBoostKruskalMinimumSpanningTree::IsTypeOf |
( |
const char * |
type | ) |
|
|
static |
virtual int vtkBoostKruskalMinimumSpanningTree::IsA |
( |
const char * |
type | ) |
|
|
virtual |
virtual vtkObjectBase* vtkBoostKruskalMinimumSpanningTree::NewInstanceInternal |
( |
| ) |
const |
|
protectedvirtual |
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: