Go to the documentation of this file.
47 #ifndef vtkUndirectedGraph_h
48 #define vtkUndirectedGraph_h
80 { this->Superclass::GetInEdge(
v, i, e); }
95 { Superclass::GetInEdges(
v, it); }
virtual void GetInEdges(vtkIdType v, const vtkInEdgeType *&edges, vtkIdType &nedges)
virtual bool IsStructureValid(vtkGraph *g)
#define vtkTypeMacro(thisClass, superclass)
Iterates through all incoming edges to a vertex.
virtual vtkInEdgeType GetInEdge(vtkIdType v, vtkIdType i)
#define VTK_UNDIRECTED_GRAPH
vtksys_stl::pair< boost::graph_traits< vtkGraph * >::edge_iterator, boost::graph_traits< vtkGraph * >::edge_iterator > edges(vtkGraph *g)
virtual vtkIdType GetInDegree(vtkIdType v)
static vtkUndirectedGraph * GetData(vtkInformationVector *v, int i=0)
virtual void GetInEdges(vtkIdType v, vtkInEdgeIterator *it)
virtual void GetInEdge(vtkIdType v, vtkIdType i, vtkGraphEdge *e)
static vtkUndirectedGraph * GetData(vtkInformation *info)
Representation of a single graph edge.
a simple class to control print indentation
#define VTKCOMMONDATAMODEL_EXPORT
void PrintSelf(ostream &os, vtkIndent indent)
Base class for graph data types.
virtual int GetDataObjectType()
static vtkUndirectedGraph * New()