Go to the documentation of this file.
38 #ifndef vtkDijkstraGraphGeodesicPath_h
39 #define vtkDijkstraGraphGeodesicPath_h
41 #include "vtkFiltersModelingModule.h"
141 void Relax(
const int& u,
const int& v,
const double& w);
represent and manipulate 3D points
int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *) override
This is called by the superclass.
Abstract base for classes that generate a geodesic path on a graph (mesh).
vtkTimeStamp AdjacencyBuildTime
vtkTypeBool UseScalarWeights
record modification and/or execution time
virtual void GetCumulativeWeights(vtkDoubleArray *weights)
Fill the array with the cumulative weights.
vtkTypeBool StopWhenEndReached
virtual double CalculateDynamicEdgeCost(vtkDataSet *, vtkIdType, vtkIdType)
void TraceShortestPath(vtkDataSet *inData, vtkPolyData *outPoly, vtkIdType startv, vtkIdType endv)
virtual void ShortestPath(vtkDataSet *inData, int startv, int endv)
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
~vtkDijkstraGraphGeodesicPath() override
a simple class to control print indentation
list of point or cell ids
void Initialize(vtkDataSet *inData)
vtkTypeBool RepelPathFromVertices
abstract class to specify dataset behavior
void Relax(const int &u, const int &v, const double &w)
virtual void SetRepelVertices(vtkPoints *)
Specify vtkPoints to use to repel the path from.
virtual double CalculateStaticEdgeCost(vtkDataSet *inData, vtkIdType u, vtkIdType v)
vtkPoints * RepelVertices
virtual void BuildAdjacency(vtkDataSet *inData)
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
vtkDijkstraGraphGeodesicPath()
static vtkDijkstraGraphGeodesicPath * New()
Instantiate the class.