Go to the documentation of this file.
219 #include "vtkCommonDataModelModule.h"
228 class vtkGraphEdgePoints;
244 class vtk_edge_iterator;
245 class vtk_out_edge_pointer_iterator;
246 class vtk_in_edge_pointer_iterator;
338 void ComputeBounds();
347 void GetBounds(
double bounds[6]);
511 virtual
void Squeeze();
582 {
double p[3] = {x, y, z}; this->SetEdgePoint(e, i, p); }
589 {
double p[3] = {x, y, z}; this->AddEdgePoint(e, p); }
743 vtkGraphEdgePoints *EdgePoints;
748 void SetEdgePoints(vtkGraphEdgePoints* edgePoints);
754 void ForceOwnership();
767 void BuildEdgeList();
777 friend class
boost::vtk_edge_iterator;
778 friend class
boost::vtk_in_edge_pointer_iterator;
779 friend class
boost::vtk_out_edge_pointer_iterator;
805 static
double DefaultPoint[3];
819 void operator=(const
vtkGraph&) VTK_DELETE_FUNCTION;
824 VTKCOMMONDATAMODEL_EXPORT ostream& operator<<(ostream& out,
vtkEdgeBase e);
represent and manipulate 3D points
vtkInEdgeType(vtkIdType s, vtkIdType id)
void DeepCopy(vtkPistonReference *self, vtkPistonReference *other)
void AddEdgePoint(vtkIdType e, double x, double y, double z)
int GetDataObjectType() override
Return what type of dataset this is.
std::pair< boost::graph_traits< vtkGraph * >::edge_iterator, boost::graph_traits< vtkGraph * >::edge_iterator > edges(vtkGraph *g)
helper for the vtkGraph class that allows the graph to be distributed across multiple memory spaces.
Internal representation of vtkGraph.
void Initialize() override
Initialize to an empty graph.
represent and manipulate attribute data in a dataset
record modification and/or execution time
vtkEdgeBase(vtkIdType id)
vtkGraphInternals * GetGraphInternals(bool modifying)
Returns the internal representation of the graph.
Forward declaration required for Boost serialization.
Iterates through all incoming edges to a vertex.
An array holding vtkVariants.
void Dump()
Dump the contents of the graph to standard output.
void GetPoint(const int i, const int j, const int k, double pnt[3])
vtkFieldData * GetAttributesAsFieldData(int type) override
Returns the attributes of the data object as a vtkFieldData.
represent and manipulate fields of data
vtkTypeUInt64 vtkMTimeType
void GetInducedEdges(vtkIdTypeArray *verts, vtkIdTypeArray *edges)
Fills a list of edge indices with the edges contained in the induced subgraph formed by the vertices ...
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
void DeepCopyEdgePoints(vtkGraph *g)
vtkOutEdgeType(vtkIdType t, vtkIdType id)
Representation of a single graph edge.
std::pair< boost::graph_traits< vtkGraph * >::vertex_iterator, boost::graph_traits< vtkGraph * >::vertex_iterator > vertices(vtkGraph *g)
bool ToUndirectedGraph(vtkUndirectedGraph *g)
Convert the graph to an undirected graph.
vtkIdType GetEdgeId(vtkIdType a, vtkIdType b)
Returns the Id of the edge between vertex a and vertex b.
a simple class to control print indentation
object to represent cell connectivity
A atomic type representing the union of many types.
Iterates through all edges in a graph.
Iterates through all outgoing edges from a vertex.
vtkIdType GetNumberOfElements(int type) override
Get the number of elements for a specific attribute type (VERTEX, EDGE, etc.).
Iterates through adjacent vertices in a graph.
vtkEdgeType(vtkIdType s, vtkIdType t, vtkIdType id)
bool ToDirectedGraph(vtkDirectedGraph *g)
Convert the graph to a directed graph.
dynamic, self-adjusting array of vtkIdType
void ShallowCopyEdgePoints(vtkGraph *g)
Copy the internal edge point data from another graph into this graph.
void AddEdgePoint(vtkIdType e, double x[3])
Adds a point to the end of the list of edge points for a certain edge.
Iterates all vertices in a graph.
Base class for graph data types.
general representation of visualization data