|  | VTK
    9.0.1
    | 
 
 
 
Go to the documentation of this file.
   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(
 
  
represent and manipulate 3D points
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
Abstract base for classes that generate a geodesic path on a graph (mesh).
vtkTimeStamp AdjacencyBuildTime
vtkTypeBool UseScalarWeights
record modification and/or execution time
vtkTypeBool StopWhenEndReached
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
vtkTypeBool RepelPathFromVertices
abstract class to specify dataset behavior
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()