mirror of
https://github.com/OpenFOAM/ThirdParty-6.git
synced 2025-12-08 06:57:43 +00:00
98 lines
3.5 KiB
C++
98 lines
3.5 KiB
C++
/*=========================================================================
|
|
|
|
Program: Visualization Toolkit
|
|
Module: vtkBoostKruskalMinimumSpanningTree.h
|
|
|
|
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
|
|
All rights reserved.
|
|
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
|
|
|
|
This software is distributed WITHOUT ANY WARRANTY; without even
|
|
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
|
|
PURPOSE. See the above copyright notice for more information.
|
|
|
|
=========================================================================*/
|
|
/*-------------------------------------------------------------------------
|
|
Copyright 2008 Sandia Corporation.
|
|
Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
|
|
the U.S. Government retains certain rights in this software.
|
|
-------------------------------------------------------------------------*/
|
|
// .NAME vtkBoostKruskalMinimumSpanningTree - Contructs a minimum spanning
|
|
// tree from a graph and the weighting array
|
|
//
|
|
// .SECTION 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.
|
|
//
|
|
// .SECTION See Also
|
|
// vtkGraph vtkBoostGraphAdapter
|
|
|
|
#ifndef vtkBoostKruskalMinimumSpanningTree_h
|
|
#define vtkBoostKruskalMinimumSpanningTree_h
|
|
|
|
#include "vtkInfovisBoostGraphAlgorithmsModule.h" // For export macro
|
|
#include "vtkStdString.h" // For string type
|
|
#include "vtkVariant.h" // For variant type
|
|
|
|
#include "vtkSelectionAlgorithm.h"
|
|
|
|
class VTKINFOVISBOOSTGRAPHALGORITHMS_EXPORT vtkBoostKruskalMinimumSpanningTree : public vtkSelectionAlgorithm
|
|
{
|
|
public:
|
|
static vtkBoostKruskalMinimumSpanningTree *New();
|
|
vtkTypeMacro(vtkBoostKruskalMinimumSpanningTree, vtkSelectionAlgorithm);
|
|
void PrintSelf(ostream& os, vtkIndent indent);
|
|
|
|
// Description:
|
|
// 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.
|
|
vtkSetStringMacro(EdgeWeightArrayName);
|
|
|
|
// Description:
|
|
// 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.
|
|
vtkSetStringMacro(OutputSelectionType);
|
|
|
|
// Description:
|
|
// 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...
|
|
void SetNegateEdgeWeights(bool value);
|
|
vtkGetMacro(NegateEdgeWeights, bool);
|
|
vtkBooleanMacro(NegateEdgeWeights, bool);
|
|
|
|
protected:
|
|
vtkBoostKruskalMinimumSpanningTree();
|
|
~vtkBoostKruskalMinimumSpanningTree();
|
|
|
|
int RequestData(
|
|
vtkInformation *,
|
|
vtkInformationVector **,
|
|
vtkInformationVector *);
|
|
|
|
int FillInputPortInformation(
|
|
int port, vtkInformation* info);
|
|
|
|
int FillOutputPortInformation(
|
|
int port, vtkInformation* info);
|
|
|
|
private:
|
|
char* EdgeWeightArrayName;
|
|
char* OutputSelectionType;
|
|
bool NegateEdgeWeights;
|
|
float EdgeWeightMultiplier;
|
|
|
|
vtkBoostKruskalMinimumSpanningTree(const vtkBoostKruskalMinimumSpanningTree&); // Not implemented.
|
|
void operator=(const vtkBoostKruskalMinimumSpanningTree&); // Not implemented.
|
|
};
|
|
|
|
#endif
|