You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

72 lines
1.9 KiB
C++

/*=========================================================================
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