VTK  9.3.20240424
vtkUndirectedGraph.h
Go to the documentation of this file.
1// SPDX-FileCopyrightText: Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
2// SPDX-FileCopyrightText: Copyright 2008 Sandia Corporation
3// SPDX-License-Identifier: LicenseRef-BSD-3-Clause-Sandia-USGov
61#ifndef vtkUndirectedGraph_h
62#define vtkUndirectedGraph_h
63
64#include "vtkCommonDataModelModule.h" // For export macro
65#include "vtkGraph.h"
66
67VTK_ABI_NAMESPACE_BEGIN
68class VTKCOMMONDATAMODEL_EXPORT vtkUndirectedGraph : public vtkGraph
69{
70public:
73 void PrintSelf(ostream& os, vtkIndent indent) override;
74
78 int GetDataObjectType() override { return VTK_UNDIRECTED_GRAPH; }
79
84
90
97 void GetInEdge(vtkIdType v, vtkIdType i, vtkGraphEdge* e) override
98 {
99 this->Superclass::GetInEdge(v, i, e);
100 }
101
103
109
114 void GetInEdges(vtkIdType v, vtkInEdgeIterator* it) override { Superclass::GetInEdges(v, it); }
115
121 bool IsStructureValid(vtkGraph* g) override;
122
123protected:
126
130 void GetInEdges(vtkIdType v, const vtkInEdgeType*& edges, vtkIdType& nedges) override;
131
132private:
133 vtkUndirectedGraph(const vtkUndirectedGraph&) = delete;
134 void operator=(const vtkUndirectedGraph&) = delete;
135};
136
137VTK_ABI_NAMESPACE_END
138#endif
Representation of a single graph edge.
Base class for graph data types.
Definition vtkGraph.h:340
Iterates through all incoming edges to a vertex.
a simple class to control print indentation
Definition vtkIndent.h:108
Store zero or more vtkInformation instances.
Store vtkAlgorithm input/output information.
An undirected graph.
int GetDataObjectType() override
Return what type of dataset this is.
vtkInEdgeType GetInEdge(vtkIdType v, vtkIdType i) override
Random-access method for retrieving the in edges of a vertex.
static vtkUndirectedGraph * New()
static vtkUndirectedGraph * GetData(vtkInformationVector *v, int i=0)
Retrieve a graph from an information vector.
void GetInEdges(vtkIdType v, const vtkInEdgeType *&edges, vtkIdType &nedges) override
For iterators, returns the same edge list as GetOutEdges().
void GetInEdges(vtkIdType v, vtkInEdgeIterator *it) override
Initialize the iterator to get the incoming edges to a vertex.
bool IsStructureValid(vtkGraph *g) override
Check the structure, and accept it if it is a valid undirected graph.
static vtkUndirectedGraph * GetData(vtkInformation *info)
Retrieve a graph from an information vector.
~vtkUndirectedGraph() override
vtkIdType GetInDegree(vtkIdType v) override
Returns the full degree of the vertex.
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.
std::pair< boost::graph_traits< vtkGraph * >::edge_iterator, boost::graph_traits< vtkGraph * >::edge_iterator > edges(vtkGraph *g)
int vtkIdType
Definition vtkType.h:315
#define VTK_UNDIRECTED_GRAPH
Definition vtkType.h:89