226 class vtkGraphEdgePoints;
243 class vtk_edge_iterator;
244 class vtk_out_edge_pointer_iterator;
245 class vtk_in_edge_pointer_iterator;
310 void GetPoint(
vtkIdType ptId,
double x[3]);
324 void ComputeBounds();
331 void GetBounds(
double bounds[6]);
442 virtual void CopyStructure(
vtkGraph *g);
446 virtual bool CheckedShallowCopy(
vtkGraph *g);
450 virtual bool CheckedDeepCopy(
vtkGraph *g);
453 virtual void Squeeze();
471 bool IsSameStructure(
vtkGraph *other);
508 {
double p[3] = {x, y, z}; this->SetEdgePoint(e, i, p); }
514 void AddEdgePoint(
vtkIdType e,
double x[3]);
516 {
double p[3] = {x, y, z}; this->AddEdgePoint(e, p); }
522 void ShallowCopyEdgePoints(
vtkGraph* g);
523 void DeepCopyEdgePoints(
vtkGraph* g);
601 void RemoveVertexInternal(
vtkIdType v,
bool directed);
605 void RemoveEdgeInternal(
vtkIdType e,
bool directed);
619 virtual bool IsStructureValid(
vtkGraph *g) = 0;
622 virtual void CopyInternal(
vtkGraph *g,
bool deep);
637 void SetEdgePoints(vtkGraphEdgePoints* edgePoints);
641 void ForceOwnership();
650 void BuildEdgeList();
680 static double DefaultPoint[3];
virtual int GetDataObjectType()
helper for the vtkGraph class that allows the graph to be distributed across multiple memory spaces...
static vtkDataObject * GetData(vtkInformation *info)
vtkDataSetAttributes * VertexData
vtkDataSetAttributes * EdgeData
virtual vtkFieldData * GetAttributesAsFieldData(int type)
Forward declaration required for Boost serialization.
An array holding vtkVariants.
vtkIdTypeArray * EdgeList
vtksys_stl::pair< boost::graph_traits< vtkGraph * >::vertex_iterator, boost::graph_traits< vtkGraph * >::vertex_iterator > vertices(vtkGraph *g)
vtksys_stl::pair< boost::graph_traits< vtkGraph * >::edge_iterator, boost::graph_traits< vtkGraph * >::edge_iterator > edges(vtkGraph *g)
Iterates through adjacent vertices in a graph.
record modification and/or execution time
Iterates through all edges in a graph.
unsigned long int GetMTime()
Representation of a single graph edge.
vtkEdgeBase(vtkIdType id)
virtual void Initialize()
dynamic, self-adjusting array of vtkIdType
vtkDistributedGraphHelper * DistributedHelper
A atomic type representing the union of many types.
Base class for graph data types.
bool VTK_FILTERING_EXPORT operator==(vtkEdgeBase e1, vtkEdgeBase e2)
a simple class to control print indentation
vtkGraphEdgePoints * EdgePoints
void SetEdgePoint(vtkIdType e, vtkIdType i, double x, double y, double z)
Iterates through all incoming edges to a vertex.
Internal representation of vtkGraph.
represent and manipulate attribute data in a dataset
void PrintSelf(ostream &os, vtkIndent indent)
virtual vtkIdType GetNumberOfElements(int type)
object to represent cell connectivity
Iterates all vertices in a graph.
vtkOutEdgeType(vtkIdType t, vtkIdType id)
vtkGraphInternals * Internals
Iterates through all outgoing edges from a vertex.
general representation of visualization data
vtkInEdgeType(vtkIdType s, vtkIdType id)
VTK_FILTERING_EXPORT ostream & operator<<(ostream &out, vtkEdgeBase e)
virtual void DeepCopy(vtkDataObject *src)
vtkEdgeType(vtkIdType s, vtkIdType t, vtkIdType id)
represent and manipulate 3D points
void AddEdgePoint(vtkIdType e, double x, double y, double z)
bool VTK_FILTERING_EXPORT operator!=(vtkEdgeBase e1, vtkEdgeBase e2)
virtual void ShallowCopy(vtkDataObject *src)
represent and manipulate fields of data