39 #ifndef vtkDijkstraGraphGeodesicPath_h 40 #define vtkDijkstraGraphGeodesicPath_h 42 #include "vtkFiltersModelingModule.h" 96 vtkBooleanMacro(RepelPathFromVertices,
vtkTypeBool);
103 virtual void SetRepelVertices(
vtkPoints*);
104 vtkGetObjectMacro(RepelVertices,
vtkPoints);
119 virtual void BuildAdjacency(
vtkDataSet* inData);
135 virtual void ShortestPath(
vtkDataSet* inData,
int startv,
int endv);
138 void Relax(
const int& u,
const int& v,
const double& w);
141 void TraceShortestPath(
void PrintSelf(ostream &os, vtkIndent indent) override
Standard methods for printing and determining type information.
abstract class to specify dataset behavior
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
This is called by the superclass.
vtkTypeBool RepelPathFromVertices
record modification and/or execution time
concrete dataset represents vertices, lines, polygons, and triangle strips
vtkPoints * RepelVertices
Dijkstra algorithm to compute the graph geodesic.
dynamic, self-adjusting array of double
static vtkPolyDataAlgorithm * New()
a simple class to control print indentation
vtkDijkstraGraphInternals * Internals
vtkTimeStamp AdjacencyBuildTime
Helper class due to PIMPL excess.
list of point or cell ids
vtkTypeBool UseScalarWeights
Abstract base for classes that generate a geodesic path on a graph (mesh).
vtkTypeBool StopWhenEndReached
virtual double CalculateDynamicEdgeCost(vtkDataSet *, vtkIdType, vtkIdType)
represent and manipulate 3D points