Go to the documentation of this file.
48 #ifndef vtkUndirectedGraph_h
49 #define vtkUndirectedGraph_h
51 #include "vtkCommonDataModelModule.h"
84 { this->Superclass::GetInEdge(v, i, e); }
99 { Superclass::GetInEdges(v, it); }
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)
Iterates through all incoming edges to a vertex.
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
void GetInEdges(vtkIdType v, vtkInEdgeIterator *it) override
Initialize the iterator to get the incoming edges to a vertex.
vtkIdType GetInDegree(vtkIdType v) override
Returns the full degree of the vertex.
#define VTK_UNDIRECTED_GRAPH
static vtkUndirectedGraph * GetData(vtkInformationVector *v, int i=0)
void GetInEdges(vtkIdType v, const vtkInEdgeType *&edges, vtkIdType &nedges) override
For iterators, returns the same edge list as GetOutEdges().
~vtkUndirectedGraph() override
static vtkUndirectedGraph * GetData(vtkInformation *info)
Retrieve a graph from an information vector.
Representation of a single graph edge.
a simple class to control print indentation
void GetInEdge(vtkIdType v, vtkIdType i, vtkGraphEdge *e) override
Random-access method for retrieving incoming edges to vertex v.
vtkInEdgeType GetInEdge(vtkIdType v, vtkIdType i) override
Random-access method for retrieving the in edges of a vertex.
Base class for graph data types.
static vtkUndirectedGraph * New()
bool IsStructureValid(vtkGraph *g) override
Check the structure, and accept it if it is a valid undirected graph.