Minimum spanning tree of a distributed vtkGraph. More...
#include <vtkPBGLMinimumSpanningTree.h>
Public Types | |
| typedef vtkGraphAlgorithm | Superclass |
Public Member Functions | |
| virtual int | IsA (const char *type) |
| vtkPBGLMinimumSpanningTree * | NewInstance () const |
| void | PrintSelf (ostream &os, vtkIndent indent) |
| virtual void | SetEdgeWeightArrayName (const char *) |
| virtual void | SetOutputSelectionType (const char *) |
Static Public Member Functions | |
| static vtkPBGLMinimumSpanningTree * | New () |
| static int | IsTypeOf (const char *type) |
| static vtkPBGLMinimumSpanningTree * | SafeDownCast (vtkObjectBase *o) |
Protected Member Functions | |
| virtual vtkObjectBase * | NewInstanceInternal () const |
| vtkPBGLMinimumSpanningTree () | |
| ~vtkPBGLMinimumSpanningTree () | |
| virtual int | RequestData (vtkInformation *, vtkInformationVector **, vtkInformationVector *) |
| virtual int | FillInputPortInformation (int port, vtkInformation *info) |
| virtual int | FillOutputPortInformation (int port, vtkInformation *info) |
Detailed Description
Minimum spanning tree of a distributed vtkGraph.
This VTK class uses the Parallel BGL minimum spanning tree generic algorithm to compute the minimum spanning tree of a weighted, undirected graph (a distributed vtkGraph).
- See also:
- vtkGraph vtkPBGLGraphAdaptor vtkBoostGraphAdapter
- Deprecated:
- Not maintained as of VTK 6.2 and will be removed eventually.
@par Tests:
@ref c2_vtk_t_vtkPBGLMinimumSpanningTree "vtkPBGLMinimumSpanningTree (Tests)"Definition at line 51 of file vtkPBGLMinimumSpanningTree.h.
Member Typedef Documentation
Reimplemented from vtkGraphAlgorithm.
Definition at line 55 of file vtkPBGLMinimumSpanningTree.h.
Constructor & Destructor Documentation
| vtkPBGLMinimumSpanningTree::vtkPBGLMinimumSpanningTree | ( | ) | [protected] |
| vtkPBGLMinimumSpanningTree::~vtkPBGLMinimumSpanningTree | ( | ) | [protected] |
Member Function Documentation
| static vtkPBGLMinimumSpanningTree* vtkPBGLMinimumSpanningTree::New | ( | ) | [static] |
Create an object with Debug turned off, modified time initialized to zero, and reference counting on.
Reimplemented from vtkGraphAlgorithm.
| static int vtkPBGLMinimumSpanningTree::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 vtkGraphAlgorithm.
| virtual int vtkPBGLMinimumSpanningTree::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 vtkGraphAlgorithm.
| static vtkPBGLMinimumSpanningTree* vtkPBGLMinimumSpanningTree::SafeDownCast | ( | vtkObjectBase * | o | ) | [static] |
Reimplemented from vtkGraphAlgorithm.
| virtual vtkObjectBase* vtkPBGLMinimumSpanningTree::NewInstanceInternal | ( | ) | const [protected, virtual] |
Reimplemented from vtkGraphAlgorithm.
Reimplemented from vtkGraphAlgorithm.
| void vtkPBGLMinimumSpanningTree::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 vtkGraphAlgorithm.
| virtual void vtkPBGLMinimumSpanningTree::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 vtkPBGLMinimumSpanningTree::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.
| virtual int vtkPBGLMinimumSpanningTree::RequestData | ( | vtkInformation * | request, |
| vtkInformationVector ** | inputVector, | ||
| vtkInformationVector * | outputVector | ||
| ) | [protected, virtual] |
This is called by the superclass. This is the method you should override.
Reimplemented from vtkGraphAlgorithm.
| virtual int vtkPBGLMinimumSpanningTree::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 vtkGraphAlgorithm.
| virtual int vtkPBGLMinimumSpanningTree::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 vtkGraphAlgorithm.
The documentation for this class was generated from the following file:
- /Users/kitware/Dashboards/MyTests/VTK_BLD_Release_docs/Utilities/Doxygen/dox/Infovis/Parallel/vtkPBGLMinimumSpanningTree.h
