37 #ifndef vtkDijkstraGraphGeodesicPath_h
38 #define vtkDijkstraGraphGeodesicPath_h
89 virtual void SetRepelVertices(
vtkPoints*);
104 virtual void BuildAdjacency(
vtkDataSet *inData );
121 virtual void ShortestPath(
vtkDataSet *inData,
int startv,
int endv );
124 void Relax(
const int& u,
const int&
v,
const double&
w);
abstract class to specify dataset behavior
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
#define vtkGetMacro(name, type)
record modification and/or execution time
#define VTKFILTERSMODELING_EXPORT
int RepelPathFromVertices
concrete dataset represents vertices, lines, polygons, and triangle strips
vtkPoints * RepelVertices
Dijkstra algorithm to compute the graph geodesic.
#define vtkTypeMacro(thisClass, superclass)
dynamic, self-adjusting array of double
void PrintSelf(ostream &os, vtkIndent indent)
static vtkPolyDataAlgorithm * New()
GLubyte GLubyte GLubyte GLubyte w
a simple class to control print indentation
vtkDijkstraGraphInternals * Internals
vtkTimeStamp AdjacencyBuildTime
Helper class due to PIMPL excess.
list of point or cell ids
Abstract base for classes that generate a geodesic path on a graph (mesh).
#define vtkGetObjectMacro(name, type)
virtual double CalculateDynamicEdgeCost(vtkDataSet *, vtkIdType, vtkIdType)
#define vtkBooleanMacro(name, type)
represent and manipulate 3D points
#define vtkSetMacro(name, type)