vtkBoostKruskalMinimumSpanningTree.h 3.5 KB
Newer Older
1
/*=========================================================================
2

3 4
Program:   Visualization Toolkit
Module:    vtkBoostKruskalMinimumSpanningTree.h
5

6 7 8
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
9

10 11 12
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.
13 14 15 16 17 18

=========================================================================*/
/*-------------------------------------------------------------------------
  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.
19
  -------------------------------------------------------------------------*/
20 21
/**
 * @class   vtkBoostKruskalMinimumSpanningTree
luz.paz's avatar
luz.paz committed
22
 * @brief   Constructs a minimum spanning
23 24 25 26 27 28 29 30 31 32 33
 *    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.
 *
 * @sa
 * vtkGraph vtkBoostGraphAdapter
*/
34

35 36
#ifndef vtkBoostKruskalMinimumSpanningTree_h
#define vtkBoostKruskalMinimumSpanningTree_h
37

38
#include "vtkInfovisBoostGraphAlgorithmsModule.h" // For export macro
39 40 41 42 43
#include "vtkStdString.h" // For string type
#include "vtkVariant.h" // For variant type

#include "vtkSelectionAlgorithm.h"

44
class VTKINFOVISBOOSTGRAPHALGORITHMS_EXPORT vtkBoostKruskalMinimumSpanningTree : public vtkSelectionAlgorithm
45 46 47
{
public:
  static vtkBoostKruskalMinimumSpanningTree *New();
48
  vtkTypeMacro(vtkBoostKruskalMinimumSpanningTree, vtkSelectionAlgorithm);
49
  void PrintSelf(ostream& os, vtkIndent indent) override;
50

51 52 53 54 55 56 57 58
  //@{
  /**
   * 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.
   */
59
  vtkSetStringMacro(EdgeWeightArrayName);
60 61 62 63 64 65 66 67
  //@}

  //@{
  /**
   * 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.
   */
68
  vtkSetStringMacro(OutputSelectionType);
69 70 71 72 73 74 75 76 77 78
  //@}

  //@{
  /**
   * 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...
   */
79 80 81
  void SetNegateEdgeWeights(bool value);
  vtkGetMacro(NegateEdgeWeights, bool);
  vtkBooleanMacro(NegateEdgeWeights, bool);
82
  //@}
83

84 85 86
protected:
  vtkBoostKruskalMinimumSpanningTree();
  ~vtkBoostKruskalMinimumSpanningTree();
87

88
  int RequestData(
89 90
    vtkInformation *,
    vtkInformationVector **,
91
    vtkInformationVector *) override;
92

93
  int FillInputPortInformation(
94
    int port, vtkInformation* info) override;
95

96
  int FillOutputPortInformation(
97
    int port, vtkInformation* info) override;
98

99 100 101
private:
  char* EdgeWeightArrayName;
  char* OutputSelectionType;
102 103
  bool NegateEdgeWeights;
  float EdgeWeightMultiplier;
104

105 106
  vtkBoostKruskalMinimumSpanningTree(const vtkBoostKruskalMinimumSpanningTree&) = delete;
  void operator=(const vtkBoostKruskalMinimumSpanningTree&) = delete;
107 108 109
};

#endif