VTK  9.2.6
vtkGraph.h
Go to the documentation of this file.
1/*=========================================================================
2
3 Program: Visualization Toolkit
4 Module: vtkGraph.h
5
6 Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
7 All rights reserved.
8 See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
9
10 This software is distributed WITHOUT ANY WARRANTY; without even
11 the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
12 PURPOSE. See the above copyright notice for more information.
13
14=========================================================================*/
15/*-------------------------------------------------------------------------
16 Copyright 2008 Sandia Corporation.
17 Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
18 the U.S. Government retains certain rights in this software.
19-------------------------------------------------------------------------*/
225#ifndef vtkGraph_h
226#define vtkGraph_h
227
228#include "vtkCommonDataModelModule.h" // For export macro
229#include "vtkDataObject.h"
230
232class vtkCellArray;
235class vtkDirectedGraph;
236class vtkGraphEdge;
237class vtkGraphEdgePoints;
240class vtkIdTypeArray;
243class vtkPoints;
246class vtkVariant;
247class vtkVariantArray;
248
249// Forward declare some boost stuff even if boost wrappers
250// are turned off.
251namespace boost
252{
253class vtk_edge_iterator;
254class vtk_out_edge_pointer_iterator;
255class vtk_in_edge_pointer_iterator;
256}
257
258// Edge structures.
260{
261 vtkEdgeBase() = default;
263 : Id(id)
264 {
265 }
267};
268
270{
271 vtkOutEdgeType() = default;
273 : vtkEdgeBase(id)
274 , Target(t)
275 {
276 }
278};
279
281{
282 vtkInEdgeType() = default;
284 : vtkEdgeBase(id)
285 , Source(s)
286 {
287 }
289};
290
292{
293 vtkEdgeType() = default;
295 : vtkEdgeBase(id)
296 , Source(s)
297 , Target(t)
298 {
299 }
302};
303
304class VTKCOMMONDATAMODEL_EXPORT vtkGraph : public vtkDataObject
305{
306public:
307 vtkTypeMacro(vtkGraph, vtkDataObject);
308 void PrintSelf(ostream& os, vtkIndent indent) override;
309
311
314 vtkGetObjectMacro(VertexData, vtkDataSetAttributes);
315 vtkGetObjectMacro(EdgeData, vtkDataSetAttributes);
317
321 int GetDataObjectType() override { return VTK_GRAPH; }
322
326 void Initialize() override;
327
329
335 double* GetPoint(vtkIdType ptId);
336 void GetPoint(vtkIdType ptId, double x[3]);
338
340
348 virtual void SetPoints(vtkPoints* points);
350
356
358
363 double* GetBounds();
364 void GetBounds(double bounds[6]);
366
371
379
387
394
399
406 virtual void GetOutEdge(vtkIdType v, vtkIdType index, vtkGraphEdge* e);
407
415
422
427
434 virtual void GetInEdge(vtkIdType v, vtkIdType index, vtkGraphEdge* e);
435
443
450 virtual void GetEdges(vtkEdgeListIterator* it);
451
457
464
470
477
482
491 vtkIdType FindVertex(const vtkVariant& pedigreeID);
492
497 void ShallowCopy(vtkDataObject* obj) override;
498
503 void DeepCopy(vtkDataObject* obj) override;
504
509 virtual void CopyStructure(vtkGraph* g);
510
516 virtual bool CheckedShallowCopy(vtkGraph* g);
517
523 virtual bool CheckedDeepCopy(vtkGraph* g);
524
528 virtual void Squeeze();
529
537 unsigned long GetActualMemorySize() override;
538
540
544 static vtkGraph* GetData(vtkInformationVector* v, int i = 0);
546
555
561
563
575
577
582 void SetEdgePoints(vtkIdType e, vtkIdType npts, const double pts[]) VTK_SIZEHINT(pts, 3 * npts);
583 void GetEdgePoints(vtkIdType e, vtkIdType& npts, double*& pts) VTK_SIZEHINT(pts, 3 * npts);
585
590
595
600
606 void SetEdgePoint(vtkIdType e, vtkIdType i, const double x[3]);
607 void SetEdgePoint(vtkIdType e, vtkIdType i, double x, double y, double z)
608 {
609 double p[3] = { x, y, z };
610 this->SetEdgePoint(e, i, p);
611 }
612
616 void AddEdgePoint(vtkIdType e, const double x[3]);
617 void AddEdgePoint(vtkIdType e, double x, double y, double z)
618 {
619 double p[3] = { x, y, z };
620 this->AddEdgePoint(e, p);
621 }
622
624
631
638
644
652
656 vtkIdType GetNumberOfElements(int type) override;
657
661 void Dump();
662
672
677
682
683protected:
685 ~vtkGraph() override;
686
694 void AddVertexInternal(vtkVariantArray* propertyArr = nullptr, vtkIdType* vertex = nullptr);
695
702 void AddVertexInternal(const vtkVariant& pedigree, vtkIdType* vertex);
703
705
712 vtkIdType u, vtkIdType v, bool directed, vtkVariantArray* propertyArr, vtkEdgeType* edge);
713 void AddEdgeInternal(const vtkVariant& uPedigree, vtkIdType v, bool directed,
714 vtkVariantArray* propertyArr, vtkEdgeType* edge);
715 void AddEdgeInternal(vtkIdType u, const vtkVariant& vPedigree, bool directed,
716 vtkVariantArray* propertyArr, vtkEdgeType* edge);
717 void AddEdgeInternal(const vtkVariant& uPedigree, const vtkVariant& vPedigree, bool directed,
718 vtkVariantArray* propertyArr, vtkEdgeType* edge);
720
725 void RemoveVertexInternal(vtkIdType v, bool directed);
726
731 void RemoveEdgeInternal(vtkIdType e, bool directed);
732
736 void RemoveVerticesInternal(vtkIdTypeArray* arr, bool directed);
737
741 void RemoveEdgesInternal(vtkIdTypeArray* arr, bool directed);
742
747 virtual bool IsStructureValid(vtkGraph* g) = 0;
748
752 virtual void CopyInternal(vtkGraph* g, bool deep);
753
758
763
768
772 vtkGraphEdgePoints* EdgePoints;
773
777 void SetEdgePoints(vtkGraphEdgePoints* edgePoints);
778
784
786
789 virtual void GetOutEdges(vtkIdType v, const vtkOutEdgeType*& edges, vtkIdType& nedges);
790 virtual void GetInEdges(vtkIdType v, const vtkInEdgeType*& edges, vtkIdType& nedges);
792
797
799
804 friend class vtkInEdgeIterator;
805 friend class vtkOutEdgeIterator;
810
812
818
822 double Bounds[6];
823
828
830
834 static double DefaultPoint[3];
836
838
841 vtkGetObjectMacro(EdgeList, vtkIdTypeArray);
842 virtual void SetEdgeList(vtkIdTypeArray* list);
845
846private:
847 vtkGraph(const vtkGraph&) = delete;
848 void operator=(const vtkGraph&) = delete;
849};
850
851bool VTKCOMMONDATAMODEL_EXPORT operator==(vtkEdgeBase e1, vtkEdgeBase e2);
852bool VTKCOMMONDATAMODEL_EXPORT operator!=(vtkEdgeBase e1, vtkEdgeBase e2);
853VTKCOMMONDATAMODEL_EXPORT ostream& operator<<(ostream& out, vtkEdgeBase e);
854
855#endif
Iterates through adjacent vertices in a graph.
object to represent cell connectivity
general representation of visualization data
represent and manipulate attribute data in a dataset
A directed graph.
helper for the vtkGraph class that allows the graph to be distributed across multiple memory spaces.
Iterates through all edges in a graph.
represent and manipulate fields of data
Representation of a single graph edge.
Internal representation of vtkGraph.
Base class for graph data types.
Definition vtkGraph.h:305
static vtkGraph * GetData(vtkInformationVector *v, int i=0)
Retrieve a graph from an information vector.
double * GetBounds()
Return a pointer to the geometry bounding box in the form (xmin,xmax, ymin,ymax, zmin,...
virtual vtkIdType GetOutDegree(vtkIdType v)
The number of outgoing edges from vertex v.
void SetEdgePoint(vtkIdType e, vtkIdType i, const double x[3])
Set an x,y,z location of a point along an edge.
void SetEdgePoint(vtkIdType e, vtkIdType i, double x, double y, double z)
Definition vtkGraph.h:607
void AddEdgePoint(vtkIdType e, double x, double y, double z)
Definition vtkGraph.h:617
vtkPoints * GetPoints()
Returns the points array for this graph.
void ComputeBounds()
Compute the bounds of the graph.
void AddEdgePoint(vtkIdType e, const double x[3])
Adds a point to the end of the list of edge points for a certain edge.
static vtkGraph * GetData(vtkInformation *info)
Retrieve a graph from an information vector.
virtual vtkIdType GetNumberOfVertices()
The number of vertices in the graph.
void BuildEdgeList()
Builds a mapping from edge id to source/target vertex id.
vtkTimeStamp ComputeTime
Time at which bounds were computed.
Definition vtkGraph.h:827
virtual void GetInEdge(vtkIdType v, vtkIdType index, vtkGraphEdge *e)
Random-access method for retrieving incoming edges to vertex v.
void AddVertexInternal(vtkVariantArray *propertyArr=nullptr, vtkIdType *vertex=nullptr)
Protected method for adding vertices, optionally with properties, used by mutable subclasses.
void AddEdgeInternal(vtkIdType u, const vtkVariant &vPedigree, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge)
Protected method for adding edges of a certain directedness used by mutable subclasses.
void AddVertexInternal(const vtkVariant &pedigree, vtkIdType *vertex)
Adds a vertex with the given pedigree ID to the graph.
void ForceOwnership()
If this instance does not own its internals, it makes a copy of the internals.
void SetDistributedGraphHelper(vtkDistributedGraphHelper *helper)
Sets the distributed graph helper of this graph, turning it into a distributed graph.
double * GetPoint(vtkIdType ptId)
These methods return the point (0,0,0) until the points structure is created, when it returns the act...
vtkIdType GetNumberOfEdgePoints(vtkIdType e)
Get the number of edge points associated with an edge.
~vtkGraph() override
virtual bool CheckedDeepCopy(vtkGraph *g)
Performs the same operation as DeepCopy(), but instead of reporting an error for an incompatible grap...
void RemoveVertexInternal(vtkIdType v, bool directed)
Removes a vertex from the graph, along with any adjacent edges.
void Initialize() override
Initialize to an empty graph.
vtkDataSetAttributes * VertexData
The vertex and edge data.
Definition vtkGraph.h:815
virtual void GetAdjacentVertices(vtkIdType v, vtkAdjacentVertexIterator *it)
Initializes the adjacent vertex iterator to iterate over all outgoing vertices from vertex v.
void RemoveEdgesInternal(vtkIdTypeArray *arr, bool directed)
Removes a collection of edges from the graph.
virtual vtkInEdgeType GetInEdge(vtkIdType v, vtkIdType index)
Random-access method for retrieving incoming edges to vertex v.
double * GetEdgePoint(vtkIdType e, vtkIdType i)
Get the x,y,z location of a point along edge e.
vtkIdType FindVertex(const vtkVariant &pedigreeID)
Retrieve the vertex with the given pedigree ID.
void GetInducedEdges(vtkIdTypeArray *verts, vtkIdTypeArray *edges)
Fills a list of edge indices with the edges contained in the induced subgraph formed by the vertices ...
virtual void SetEdgeList(vtkIdTypeArray *list)
The optional mapping from edge id to source/target ids.
void SetEdgePoints(vtkIdType e, vtkIdType npts, const double pts[])
Get/Set the internal edge control points associated with each edge.
vtkIdTypeArray * EdgeList
The optional mapping from edge id to source/target ids.
Definition vtkGraph.h:843
vtkGraphEdgePoints * EdgePoints
The structure for holding the edge points.
Definition vtkGraph.h:772
vtkIdType GetTargetVertex(vtkIdType e)
Retrieve the source and target vertices for an edge id.
void RemoveEdgeInternal(vtkIdType e, bool directed)
Removes an edge from the graph.
bool IsSameStructure(vtkGraph *other)
Returns true if both graphs point to the same adjacency structure.
vtkMTimeType GetMTime() override
The modified time of the graph.
void RemoveVerticesInternal(vtkIdTypeArray *arr, bool directed)
Removes a collection of vertices from the graph, along with any adjacent edges.
bool ToUndirectedGraph(vtkUndirectedGraph *g)
Convert the graph to an undirected graph.
void AddEdgeInternal(const vtkVariant &uPedigree, const vtkVariant &vPedigree, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge)
Protected method for adding edges of a certain directedness used by mutable subclasses.
void AddEdgeInternal(const vtkVariant &uPedigree, vtkIdType v, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge)
Protected method for adding edges of a certain directedness used by mutable subclasses.
virtual void CopyStructure(vtkGraph *g)
Does a shallow copy of the topological information, but not the associated attributes.
virtual void CopyInternal(vtkGraph *g, bool deep)
Copy internal data structure.
void GetBounds(double bounds[6])
Return a pointer to the geometry bounding box in the form (xmin,xmax, ymin,ymax, zmin,...
vtkIdType GetEdgeId(vtkIdType a, vtkIdType b)
Returns the Id of the edge between vertex a and vertex b.
vtkPoints * Points
The vertex locations.
Definition vtkGraph.h:833
virtual bool CheckedShallowCopy(vtkGraph *g)
Performs the same operation as ShallowCopy(), but instead of reporting an error for an incompatible g...
void ShallowCopy(vtkDataObject *obj) override
Shallow copies the data object into this graph.
virtual void SetPoints(vtkPoints *points)
Returns the points array for this graph.
bool ToDirectedGraph(vtkDirectedGraph *g)
Convert the graph to a directed graph.
virtual void Squeeze()
Reclaim unused memory.
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
virtual void GetInEdges(vtkIdType v, vtkInEdgeIterator *it)
Initializes the in edge iterator to iterate over all incoming edges to vertex v.
vtkIdType GetSourceVertex(vtkIdType e)
Retrieve the source and target vertices for an edge id.
void DeepCopyEdgePoints(vtkGraph *g)
Copy the internal edge point data from another graph into this graph.
vtkDistributedGraphHelper * DistributedHelper
The distributed graph helper.
Definition vtkGraph.h:762
virtual void GetOutEdges(vtkIdType v, vtkOutEdgeIterator *it)
Initializes the out edge iterator to iterate over all outgoing edges of vertex v.
virtual void GetInEdges(vtkIdType v, const vtkInEdgeType *&edges, vtkIdType &nedges)
Fast access functions for iterators.
void DeepCopy(vtkDataObject *obj) override
Deep copies the data object into this graph.
vtkFieldData * GetAttributesAsFieldData(int type) override
Returns the attributes of the data object as a vtkFieldData.
virtual void GetOutEdge(vtkIdType v, vtkIdType index, vtkGraphEdge *e)
Random-access method for retrieving outgoing edges from vertex v.
vtkDistributedGraphHelper * GetDistributedGraphHelper()
Retrieves the distributed graph helper for this graph.
void ClearEdgePoints(vtkIdType e)
Clear all points associated with an edge.
int GetDataObjectType() override
Return what type of dataset this is.
Definition vtkGraph.h:321
void AddEdgeInternal(vtkIdType u, vtkIdType v, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge)
Protected method for adding edges of a certain directedness used by mutable subclasses.
void SetInternals(vtkGraphInternals *internals)
Private method for setting internals.
virtual void GetOutEdges(vtkIdType v, const vtkOutEdgeType *&edges, vtkIdType &nedges)
Fast access functions for iterators.
vtkGraphInternals * Internals
The adjacency list internals of this graph.
Definition vtkGraph.h:757
virtual void GetEdges(vtkEdgeListIterator *it)
Initializes the edge list iterator to iterate over all edges in the graph.
unsigned long GetActualMemorySize() override
Return the actual size of the data in kibibytes (1024 bytes).
virtual vtkIdType GetNumberOfEdges()
The number of edges in the graph.
vtkGraphInternals * GetGraphInternals(bool modifying)
Returns the internal representation of the graph.
void ShallowCopyEdgePoints(vtkGraph *g)
Copy the internal edge point data from another graph into this graph.
void SetEdgePoints(vtkGraphEdgePoints *edgePoints)
Private method for setting edge points.
void Dump()
Dump the contents of the graph to standard output.
virtual vtkIdType GetInDegree(vtkIdType v)
The number of incoming edges to vertex v.
void GetEdgePoints(vtkIdType e, vtkIdType &npts, double *&pts)
Get/Set the internal edge control points associated with each edge.
vtkDataSetAttributes * EdgeData
The vertex and edge data.
Definition vtkGraph.h:816
virtual vtkOutEdgeType GetOutEdge(vtkIdType v, vtkIdType index)
Random-access method for retrieving outgoing edges from vertex v.
void GetPoint(vtkIdType ptId, double x[3])
These methods return the point (0,0,0) until the points structure is created, when it returns the act...
void ReorderOutVertices(vtkIdType v, vtkIdTypeArray *vertices)
Reorder the outgoing vertices of a vertex.
vtkIdType GetNumberOfElements(int type) override
Get the number of elements for a specific attribute type (VERTEX, EDGE, etc.).
virtual void GetVertices(vtkVertexListIterator *it)
Initializes the vertex list iterator to iterate over all vertices in the graph.
virtual vtkIdType GetDegree(vtkIdType v)
The total of all incoming and outgoing vertices for vertex v.
virtual bool IsStructureValid(vtkGraph *g)=0
Subclasses override this method to accept the structure based on their requirements.
dynamic, self-adjusting array of vtkIdType
Iterates through all incoming edges to a vertex.
a simple class to control print indentation
Definition vtkIndent.h:49
Store zero or more vtkInformation instances.
Store vtkAlgorithm input/output information.
Iterates through all outgoing edges from a vertex.
represent and manipulate 3D points
Definition vtkPoints.h:49
record modification and/or execution time
An undirected graph.
An array holding vtkVariants.
A atomic type representing the union of many types.
Definition vtkVariant.h:79
Iterates all vertices in a graph.
Forward declaration required for Boost serialization.
vtkEdgeBase()=default
vtkIdType Id
Definition vtkGraph.h:266
vtkEdgeBase(vtkIdType id)
Definition vtkGraph.h:262
vtkEdgeType(vtkIdType s, vtkIdType t, vtkIdType id)
Definition vtkGraph.h:294
vtkIdType Target
Definition vtkGraph.h:301
vtkEdgeType()=default
vtkIdType Source
Definition vtkGraph.h:300
vtkIdType Source
Definition vtkGraph.h:288
vtkInEdgeType(vtkIdType s, vtkIdType id)
Definition vtkGraph.h:283
vtkInEdgeType()=default
vtkIdType Target
Definition vtkGraph.h:277
vtkOutEdgeType(vtkIdType t, vtkIdType id)
Definition vtkGraph.h:272
vtkOutEdgeType()=default
std::pair< boost::graph_traits< vtkGraph * >::edge_iterator, boost::graph_traits< vtkGraph * >::edge_iterator > edges(vtkGraph *g)
std::pair< boost::graph_traits< vtkGraph * >::vertex_iterator, boost::graph_traits< vtkGraph * >::vertex_iterator > vertices(vtkGraph *g)
bool VTKCOMMONDATAMODEL_EXPORT operator==(vtkEdgeBase e1, vtkEdgeBase e2)
VTKCOMMONDATAMODEL_EXPORT ostream & operator<<(ostream &out, vtkEdgeBase e)
bool VTKCOMMONDATAMODEL_EXPORT operator!=(vtkEdgeBase e1, vtkEdgeBase e2)
int vtkIdType
Definition vtkType.h:332
vtkTypeUInt32 vtkMTimeType
Definition vtkType.h:287
#define VTK_GRAPH
Definition vtkType.h:97
#define VTK_SIZEHINT(...)