1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkGraphGeodesicPath.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.
=========================================================================*/
/**
* @class vtkGraphGeodesicPath
* @brief Abstract base for classes that generate a geodesic path on a graph (mesh).
*
* Serves as a base class for algorithms that trace a geodesic on a
* polygonal dataset treating it as a graph. ie points connecting the
* vertices of the graph
*/
#ifndef vtkGraphGeodesicPath_h
#define vtkGraphGeodesicPath_h
#include "vtkFiltersModelingModule.h" // For export macro
#include "vtkGeodesicPath.h"
class vtkIdList;
class VTKFILTERSMODELING_EXPORT vtkGraphGeodesicPath : public vtkGeodesicPath
{
public:
//@{
/**
* Standard methods for printing and determining type information.
*/
vtkTypeMacro(vtkGraphGeodesicPath, vtkGeodesicPath);
void PrintSelf(ostream& os, vtkIndent indent) override;
//@}
//@{
/**
* The vertex at the start of the shortest path
*/
vtkGetMacro(StartVertex, vtkIdType);
vtkSetMacro(StartVertex, vtkIdType);
//@}
//@{
/**
* The vertex at the end of the shortest path
*/
vtkGetMacro(EndVertex, vtkIdType);
vtkSetMacro(EndVertex, vtkIdType);
//@}
protected:
vtkGraphGeodesicPath();
~vtkGraphGeodesicPath() override;
vtkIdType StartVertex;
vtkIdType EndVertex;
private:
vtkGraphGeodesicPath(const vtkGraphGeodesicPath&) = delete;
void operator=(const vtkGraphGeodesicPath&) = delete;
};
#endif
|
