Contructs a minimum spanning tree from a graph and the weighting array. More...
#include <vtkBoostKruskalMinimumSpanningTree.h>
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
Definition at line 46 of file vtkBoostKruskalMinimumSpanningTree.h.
Member Typedef Documentation
Reimplemented from vtkSelectionAlgorithm.
Definition at line 50 of file vtkBoostKruskalMinimumSpanningTree.h.
Constructor & Destructor Documentation
Member Function Documentation
| static vtkBoostKruskalMinimumSpanningTree* vtkBoostKruskalMinimumSpanningTree::New | ( | ) | [static] |
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
Reimplemented from vtkSelectionAlgorithm.
| static int vtkBoostKruskalMinimumSpanningTree::IsTypeOf | ( | const char * | name | ) | [static] |
Return 1 if this class type is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h.
Reimplemented from vtkSelectionAlgorithm.
| virtual int vtkBoostKruskalMinimumSpanningTree::IsA | ( | const char * | name | ) | [virtual] |
Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h.
Reimplemented from vtkSelectionAlgorithm.
| static vtkBoostKruskalMinimumSpanningTree* vtkBoostKruskalMinimumSpanningTree::SafeDownCast | ( | vtkObjectBase * | o | ) | [static] |
Reimplemented from vtkSelectionAlgorithm.
| virtual vtkObjectBase* vtkBoostKruskalMinimumSpanningTree::NewInstanceInternal | ( | ) | const [protected, virtual] |
Reimplemented from vtkSelectionAlgorithm.
Reimplemented from vtkSelectionAlgorithm.
| void vtkBoostKruskalMinimumSpanningTree::PrintSelf | ( | ostream & | os, |
| vtkIndent | indent | ||
| ) | [virtual] |
Methods invoked by print to print information about the object including superclasses. Typically not called by the user (use Print() instead) but used in the hierarchical print process to combine the output of several classes.
Reimplemented from vtkSelectionAlgorithm.
| 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 * | request, |
| vtkInformationVector ** | inputVector, | ||
| vtkInformationVector * | outputVector | ||
| ) | [protected, virtual] |
This is called by the superclass. This is the method you should override.
Reimplemented from vtkSelectionAlgorithm.
| int vtkBoostKruskalMinimumSpanningTree::FillInputPortInformation | ( | int | port, |
| vtkInformation * | info | ||
| ) | [protected, virtual] |
Fill the input port information objects for this algorithm. This is invoked by the first call to GetInputPortInformation for each port so subclasses can specify what they can handle.
Reimplemented from vtkSelectionAlgorithm.
| int vtkBoostKruskalMinimumSpanningTree::FillOutputPortInformation | ( | int | port, |
| vtkInformation * | info | ||
| ) | [protected, virtual] |
Fill the output port information objects for this algorithm. This is invoked by the first call to GetOutputPortInformation for each port so subclasses can specify what they can handle.
Reimplemented from vtkSelectionAlgorithm.
The documentation for this class was generated from the following file:
- dox/Infovis/BoostGraphAlgorithms/vtkBoostKruskalMinimumSpanningTree.h
