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);
void GetPoint(const int i, const int j, const int k, double pnt[3])
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
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.
void AddEdgePoint(vtkIdType e, double x, double y, double z)
void AddEdgePoint(vtkIdType e, double x[3])
Adds a point to the end of the list of edge points for a certain edge.
void Initialize() override
Initialize to an empty graph.
void GetInducedEdges(vtkIdTypeArray *verts, vtkIdTypeArray *edges)
Fills a list of edge indices with the edges contained in the induced subgraph formed by the vertices ...
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.
vtkGraphInternals * GetGraphInternals(bool modifying)
Returns the internal representation of the graph.
bool ToDirectedGraph(vtkDirectedGraph *g)
Convert the graph to a directed graph.
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
void DeepCopyEdgePoints(vtkGraph *g)
int GetDataObjectType() override
Return what type of dataset this is.
void ShallowCopyEdgePoints(vtkGraph *g)
Copy the internal edge point data from another graph into this graph.
void Dump()
Dump the contents of the graph to standard output.
vtkFieldData * GetAttributesAsFieldData(int type) override
Returns the attributes of the data object as a vtkFieldData.
vtkIdType GetNumberOfElements(int type) override
Get the number of elements for a specific attribute type (VERTEX, EDGE, etc.).
dynamic, self-adjusting array of vtkIdType
Iterates through all incoming edges to a vertex.
a simple class to control print indentation
Iterates through all outgoing edges from a vertex.
represent and manipulate 3D points
record modification and/or execution time
An array holding vtkVariants.
A atomic type representing the union of many types.
Iterates all vertices in a graph.
Forward declaration required for Boost serialization.
void DeepCopy(vtkPistonReference *self, vtkPistonReference *other)
vtkEdgeBase(vtkIdType id)
vtkEdgeType(vtkIdType s, vtkIdType t, vtkIdType id)
vtkInEdgeType(vtkIdType s, vtkIdType id)
vtkOutEdgeType(vtkIdType t, vtkIdType id)
std::pair< boost::graph_traits< vtkGraph * >::vertex_iterator, boost::graph_traits< vtkGraph * >::vertex_iterator > vertices(vtkGraph *g)
std::pair< boost::graph_traits< vtkGraph * >::edge_iterator, boost::graph_traits< vtkGraph * >::edge_iterator > edges(vtkGraph *g)
vtkTypeUInt64 vtkMTimeType