52 #ifndef vtkDijkstraImageGeodesicPath_h 53 #define vtkDijkstraImageGeodesicPath_h 82 void SetImageWeight(
double );
88 void SetEdgeLengthWeight(
double );
GLenum GLsizei GLenum GLenum const GLvoid * image
virtual int RequestData(vtkInformation *, vtkInformationVector **, vtkInformationVector *)
abstract class to specify dataset behavior
#define vtkGetMacro(name, type)
#define VTKFILTERSMODELING_EXPORT
virtual void BuildAdjacency(vtkDataSet *inData)
#define vtkSetClampMacro(name, type, min, max)
void PrintSelf(ostream &os, vtkIndent indent)
Dijkstra algorithm to compute the graph geodesic.
#define vtkTypeMacro(thisClass, superclass)
virtual double CalculateStaticEdgeCost(vtkDataSet *inData, vtkIdType u, vtkIdType v)
static vtkDijkstraGraphGeodesicPath * New()
a simple class to control print indentation
topologically and geometrically regular array of data
void SetInputData(vtkDataObject *)
virtual double CalculateDynamicEdgeCost(vtkDataSet *, vtkIdType, vtkIdType)
virtual int FillInputPortInformation(int port, vtkInformation *info)
general representation of visualization data
Dijkstra algorithm to compute the graph geodesic.