213 #include "vtkCommonDataModelModule.h" 222 class vtkGraphEdgePoints;
238 class vtk_edge_iterator;
239 class vtk_out_edge_pointer_iterator;
240 class vtk_in_edge_pointer_iterator;
285 void PrintSelf(ostream& os,
vtkIndent indent) VTK_OVERRIDE;
303 void Initialize() VTK_OVERRIDE;
332 void ComputeBounds();
341 void GetBounds(
double bounds[6]);
486 virtual void CopyStructure(
vtkGraph *g);
493 virtual bool CheckedShallowCopy(
vtkGraph *g);
500 virtual bool CheckedDeepCopy(
vtkGraph *g);
505 virtual void Squeeze();
528 bool IsSameStructure(
vtkGraph *other);
576 {
double p[3] = {x, y, z}; this->SetEdgePoint(e, i, p); }
581 void AddEdgePoint(
vtkIdType e,
double x[3]);
583 {
double p[3] = {x, y, z}; this->AddEdgePoint(e, p); }
590 void ShallowCopyEdgePoints(
vtkGraph* g);
591 void DeepCopyEdgePoints(
vtkGraph* g);
618 vtkIdType GetNumberOfElements(
int type) VTK_OVERRIDE;
690 void RemoveVertexInternal(
vtkIdType v,
bool directed);
696 void RemoveEdgeInternal(
vtkIdType e,
bool directed);
712 virtual bool IsStructureValid(
vtkGraph *g) = 0;
717 virtual void CopyInternal(
vtkGraph *g,
bool deep);
742 void SetEdgePoints(vtkGraphEdgePoints* edgePoints);
748 void ForceOwnership();
761 void BuildEdgeList();
799 static double DefaultPoint[3];
813 void operator=(
const vtkGraph&) VTK_DELETE_FUNCTION;
helper for the vtkGraph class that allows the graph to be distributed across multiple memory spaces...
vtkDataSetAttributes * VertexData
The vertex and edge data.
vtkDataSetAttributes * EdgeData
The vertex and edge data.
Forward declaration required for Boost serialization.
An array holding vtkVariants.
vtkIdTypeArray * EdgeList
The optional mapping from edge id to source/target ids.
vtkTypeUInt32 vtkMTimeType
Iterates through adjacent vertices in a graph.
bool VTKCOMMONDATAMODEL_EXPORT operator!=(vtkEdgeBase e1, vtkEdgeBase e2)
record modification and/or execution time
Iterates through all edges in a graph.
Representation of a single graph edge.
vtkEdgeBase(vtkIdType id)
dynamic, self-adjusting array of vtkIdType
vtkDistributedGraphHelper * DistributedHelper
The distributed graph helper.
vtkTimeStamp ComputeTime
Time at which bounds were computed.
void GetPoint(const int i, const int j, const int k, double pnt[3])
A atomic type representing the union of many types.
Base class for graph data types.
bool VTKCOMMONDATAMODEL_EXPORT operator==(vtkEdgeBase e1, vtkEdgeBase e2)
a simple class to control print indentation
VTKCOMMONDATAMODEL_EXPORT ostream & operator<<(ostream &out, vtkEdgeBase e)
vtkGraphEdgePoints * EdgePoints
The structure for holding the edge points.
void SetEdgePoint(vtkIdType e, vtkIdType i, double x, double y, double z)
std::pair< boost::graph_traits< vtkGraph *>::vertex_iterator, boost::graph_traits< vtkGraph *>::vertex_iterator > vertices(vtkGraph *g)
Iterates through all incoming edges to a vertex.
Internal representation of vtkGraph.
represent and manipulate attribute data in a dataset
vtkPoints * Points
The vertex locations.
object to represent cell connectivity
Iterates all vertices in a graph.
vtkOutEdgeType(vtkIdType t, vtkIdType id)
int GetDataObjectType() override
Return what type of dataset this is.
vtkGraphInternals * Internals
The adjacency list internals of this graph.
Iterates through all outgoing edges from a vertex.
general representation of visualization data
vtkInEdgeType(vtkIdType s, vtkIdType id)
vtkEdgeType(vtkIdType s, vtkIdType t, vtkIdType id)
represent and manipulate 3D points
void AddEdgePoint(vtkIdType e, double x, double y, double z)
std::pair< boost::graph_traits< vtkGraph *>::edge_iterator, boost::graph_traits< vtkGraph *>::edge_iterator > edges(vtkGraph *g)
represent and manipulate fields of data