VTK  9.2.6
vtkDijkstraGraphGeodesicPath.h
Go to the documentation of this file.
1/*=========================================================================
2
3 Program: Visualization Toolkit
4 Module: vtkDijkstraGraphGeodesicPath.h
5
6 Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
7 All rights reserved.
8 See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
9
10 This software is distributed WITHOUT ANY WARRANTY; without even
11 the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
12 PURPOSE. See the above copyright notice for more information.
13
14=========================================================================*/
42#ifndef vtkDijkstraGraphGeodesicPath_h
43#define vtkDijkstraGraphGeodesicPath_h
44
45#include "vtkFiltersModelingModule.h" // For export macro
47
49class vtkIdList;
50
51class VTKFILTERSMODELING_EXPORT vtkDijkstraGraphGeodesicPath : public vtkGraphGeodesicPath
52{
53public:
58
60
64 void PrintSelf(ostream& os, vtkIndent indent) override;
66
68
71 vtkGetObjectMacro(IdList, vtkIdList);
73
75
79 vtkSetMacro(StopWhenEndReached, vtkTypeBool);
80 vtkGetMacro(StopWhenEndReached, vtkTypeBool);
81 vtkBooleanMacro(StopWhenEndReached, vtkTypeBool);
83
85
88 vtkSetMacro(UseScalarWeights, vtkTypeBool);
89 vtkGetMacro(UseScalarWeights, vtkTypeBool);
90 vtkBooleanMacro(UseScalarWeights, vtkTypeBool);
92
94
97 vtkSetMacro(RepelPathFromVertices, vtkTypeBool);
98 vtkGetMacro(RepelPathFromVertices, vtkTypeBool);
99 vtkBooleanMacro(RepelPathFromVertices, vtkTypeBool);
101
103
107 vtkGetObjectMacro(RepelVertices, vtkPoints);
109
113 virtual void GetCumulativeWeights(vtkDoubleArray* weights);
114
115protected:
118
120
121 // Build a graph description of the input.
122 virtual void BuildAdjacency(vtkDataSet* inData);
123
125
126 // The fixed cost going from vertex u to v.
128
129 // The cost going from vertex u to v that may depend on one or more vertices
130 // that precede u.
131 virtual double CalculateDynamicEdgeCost(vtkDataSet*, vtkIdType, vtkIdType) { return 0.0; }
132
133 void Initialize(vtkDataSet* inData);
134
135 void Reset();
136
137 // Calculate shortest path from vertex startv to vertex endv.
138 virtual void ShortestPath(vtkDataSet* inData, int startv, int endv);
139
140 // Relax edge u,v with weight w.
141 void Relax(const int& u, const int& v, const double& w);
142
143 // Backtrace the shortest path
145 vtkDataSet* inData, vtkPolyData* outPoly, vtkIdType startv, vtkIdType endv);
146
147 // The number of vertices.
149
150 // The vertex ids on the shortest path.
152
153 // Internalized STL containers.
155
159
161
162private:
164 void operator=(const vtkDijkstraGraphGeodesicPath&) = delete;
165};
166
167#endif
abstract class to specify dataset behavior
Definition: vtkDataSet.h:63
Dijkstra algorithm to compute the graph geodesic.
virtual double CalculateDynamicEdgeCost(vtkDataSet *, vtkIdType, vtkIdType)
virtual void SetRepelVertices(vtkPoints *)
Specify vtkPoints to use to repel the path from.
void Initialize(vtkDataSet *inData)
void TraceShortestPath(vtkDataSet *inData, vtkPolyData *outPoly, vtkIdType startv, vtkIdType endv)
virtual void BuildAdjacency(vtkDataSet *inData)
vtkDijkstraGraphInternals * Internals
void PrintSelf(ostream &os, vtkIndent indent) override
Standard methods for printing and determining type information.
void Relax(const int &u, const int &v, const double &w)
~vtkDijkstraGraphGeodesicPath() override
virtual double CalculateStaticEdgeCost(vtkDataSet *inData, vtkIdType u, vtkIdType v)
virtual void GetCumulativeWeights(vtkDoubleArray *weights)
Fill the array with the cumulative weights.
int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *) override
This is called by the superclass.
static vtkDijkstraGraphGeodesicPath * New()
Instantiate the class.
virtual void ShortestPath(vtkDataSet *inData, int startv, int endv)
Helper class due to PIMPL excess.
dynamic, self-adjusting array of double
Abstract base for classes that generate a geodesic path on a graph (mesh).
list of point or cell ids
Definition: vtkIdList.h:34
a simple class to control print indentation
Definition: vtkIndent.h:40
Store zero or more vtkInformation instances.
Store vtkAlgorithm input/output information.
represent and manipulate 3D points
Definition: vtkPoints.h:40
concrete dataset represents vertices, lines, polygons, and triangle strips
Definition: vtkPolyData.h:91
record modification and/or execution time
Definition: vtkTimeStamp.h:36
int vtkTypeBool
Definition: vtkABI.h:69
int vtkIdType
Definition: vtkType.h:332