Go to the documentation of this file.
38 #ifndef vtkDijkstraGraphGeodesicPath_h
39 #define vtkDijkstraGraphGeodesicPath_h
41 #include "vtkFiltersModelingModule.h"
78 vtkGetMacro(StopWhenEndReached,
int);
87 vtkGetMacro(UseScalarWeights,
int);
96 vtkGetMacro(RepelPathFromVertices,
int);
104 virtual void SetRepelVertices(
vtkPoints*);
105 vtkGetObjectMacro(RepelVertices,
vtkPoints);
121 virtual void BuildAdjacency(
vtkDataSet *inData );
138 virtual void ShortestPath(
vtkDataSet *inData,
int startv,
int endv );
141 void Relax(
const int& u,
const int& v,
const double& w);
represent and manipulate 3D points
Abstract base for classes that generate a geodesic path on a graph (mesh).
vtkTimeStamp AdjacencyBuildTime
void PrintSelf(ostream &os, vtkIndent indent)
Methods invoked by print to print information about the object including superclasses.
record modification and/or execution time
virtual double CalculateDynamicEdgeCost(vtkDataSet *, vtkIdType, vtkIdType)
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
This is called by the superclass.
a simple class to control print indentation
list of point or cell ids
abstract class to specify dataset behavior
vtkBooleanMacro(IgnoreDriverBugs, bool)
Updates the extensions string.
int RepelPathFromVertices
vtkSetMacro(IgnoreDriverBugs, bool)
Updates the extensions string.
vtkPoints * RepelVertices
concrete dataset represents vertices, lines, polygons, and triangle strips
Dijkstra algorithm to compute the graph geodesic.
Helper class due to PIMPL excess.
dynamic, self-adjusting array of double
vtkDijkstraGraphInternals * Internals
static vtkPolyDataAlgorithm * New()