37 #ifndef __vtkPBGLShortestPaths_h
38 #define __vtkPBGLShortestPaths_h
40 #include "vtkInfovisParallelModule.h"
78 void SetOriginVertexString(
char* arrayName,
char* value);
85 vtkSetStringMacro(EdgeWeightArrayName);
99 vtkSetMacro(Delta,
double);
108 vtkSetStringMacro(PredecessorArrayName);
118 vtkSetStringMacro(PathLengthArrayName);
126 vtkSetMacro(OriginFromSelection,
bool);
127 vtkGetMacro(OriginFromSelection,
bool);
128 vtkBooleanMacro(OriginFromSelection,
bool);
135 vtkGetMacro(OutputSelection,
bool);
136 vtkSetMacro(OutputSelection,
bool);
137 vtkBooleanMacro(OutputSelection,
bool);
144 vtkSetStringMacro(OutputSelectionType);
151 vtkSetMacro(UseUniformEdgeWeights,
bool);
152 vtkGetMacro(UseUniformEdgeWeights,
bool);
153 vtkBooleanMacro(UseUniformEdgeWeights,
bool);
175 char* InputArrayName;
176 char* EdgeWeightArrayName;
178 char* PredecessorArrayName;
179 char* PathLengthArrayName;
181 bool OutputSelection;
182 bool OriginFromSelection;
183 bool UseUniformEdgeWeights;
184 char* OutputSelectionType;
188 vtkSetStringMacro(InputArrayName);
static vtkGraphAlgorithm * New()
Wrapper around std::string to keep symbols short.
Abstract superclass for all arrays.
A node in a selection tree. Used to store selection results.
virtual int FillOutputPortInformation(int port, vtkInformation *info)
Superclass for algorithms that produce only graph as output.
A atomic type representing the union of many types.
Proxy object to connect input/output ports.
a simple class to control print indentation
void PrintSelf(ostream &os, vtkIndent indent)
Compute the shortest paths from the origin vertex to all other vertices in a distributed vtkGraph...
virtual void SetInputConnection(int port, vtkAlgorithmOutput *input)
virtual int RequestData(vtkInformation *request, vtkInformationVector **inputVector, vtkInformationVector *outputVector)
void SetOriginSelectionConnection(vtkAlgorithmOutput *algOutput)
virtual int FillInputPortInformation(int port, vtkInformation *info)