48 #ifndef vtkUndirectedGraph_h 49 #define vtkUndirectedGraph_h 51 #include "vtkCommonDataModelModule.h" 84 { this->Superclass::GetInEdge(v, i, e); }
99 { Superclass::GetInEdges(v, it); }
static vtkDataObject * New()
#define VTK_UNDIRECTED_GRAPH
Representation of a single graph edge.
static vtkGraph * GetData(vtkInformation *info)
Retrieve a graph from an information vector.
virtual void GetInEdges(vtkIdType v, vtkInEdgeIterator *it)
Initializes the in edge iterator to iterate over all incoming edges to vertex v.
void GetInEdges(vtkIdType v, vtkInEdgeIterator *it) override
Initialize the iterator to get the incoming edges to a vertex.
virtual vtkInEdgeType GetInEdge(vtkIdType v, vtkIdType index)
Random-access method for retrieving incoming edges to vertex v.
Base class for graph data types.
a simple class to control print indentation
int GetDataObjectType() override
Return what type of dataset this is.
Iterates through all incoming edges to a vertex.
virtual vtkIdType GetInDegree(vtkIdType v)
The number of incoming edges to vertex v.
void PrintSelf(ostream &os, vtkIndent indent) override
Methods invoked by print to print information about the object including superclasses.
void GetInEdge(vtkIdType v, vtkIdType i, vtkGraphEdge *e) override
Random-access method for retrieving incoming edges to vertex v.
virtual bool IsStructureValid(vtkGraph *g)=0
Subclasses override this method to accept the structure based on their requirements.
std::pair< boost::graph_traits< vtkGraph * >::edge_iterator, boost::graph_traits< vtkGraph * >::edge_iterator > edges(vtkGraph *g)