VTK
|
An undirected graph. More...
#include <vtkUndirectedGraph.h>
Public Types | |
typedef vtkGraph | Superclass |
![]() | |
typedef vtkDataObject | Superclass |
![]() | |
typedef vtkObject | Superclass |
enum | FieldAssociations { FIELD_ASSOCIATION_POINTS, FIELD_ASSOCIATION_CELLS, FIELD_ASSOCIATION_NONE, FIELD_ASSOCIATION_POINTS_THEN_CELLS, FIELD_ASSOCIATION_VERTICES, FIELD_ASSOCIATION_EDGES, FIELD_ASSOCIATION_ROWS, NUMBER_OF_ASSOCIATIONS } |
enum | AttributeTypes { POINT, CELL, FIELD, POINT_THEN_CELL, VERTEX, EDGE, ROW, NUMBER_OF_ATTRIBUTE_TYPES } |
enum | FieldOperations { FIELD_OPERATION_PRESERVED, FIELD_OPERATION_REINTERPOLATED, FIELD_OPERATION_MODIFIED, FIELD_OPERATION_REMOVED } |
![]() | |
typedef vtkObjectBase | Superclass |
Protected Member Functions | |
virtual vtkObjectBase * | NewInstanceInternal () const |
vtkUndirectedGraph () | |
~vtkUndirectedGraph () | |
virtual void | GetInEdges (vtkIdType v, const vtkInEdgeType *&edges, vtkIdType &nedges) |
![]() | |
vtkGraph () | |
~vtkGraph () | |
void | AddVertexInternal (const vtkVariant &pedigree, vtkIdType *vertex) |
void | RemoveVertexInternal (vtkIdType v, bool directed) |
void | RemoveEdgeInternal (vtkIdType e, bool directed) |
void | RemoveVerticesInternal (vtkIdTypeArray *arr, bool directed) |
virtual void | CopyInternal (vtkGraph *g, bool deep) |
void | SetInternals (vtkGraphInternals *internals) |
void | SetEdgePoints (vtkGraphEdgePoints *edgePoints) |
void | ForceOwnership () |
void | BuildEdgeList () |
void | AddVertexInternal (vtkVariantArray *propertyArr=0, vtkIdType *vertex=0) |
void | AddEdgeInternal (vtkIdType u, vtkIdType v, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge) |
void | AddEdgeInternal (const vtkVariant &uPedigree, vtkIdType v, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge) |
void | AddEdgeInternal (vtkIdType u, const vtkVariant &vPedigree, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge) |
void | AddEdgeInternal (const vtkVariant &uPedigree, const vtkVariant &vPedigree, bool directed, vtkVariantArray *propertyArr, vtkEdgeType *edge) |
void | RemoveEdgesInternal (vtkIdTypeArray *arr, bool directed) |
virtual void | GetOutEdges (vtkIdType v, const vtkOutEdgeType *&edges, vtkIdType &nedges) |
virtual vtkIdTypeArray * | GetEdgeList () |
virtual void | SetEdgeList (vtkIdTypeArray *list) |
![]() | |
vtkDataObject () | |
~vtkDataObject () | |
![]() | |
vtkObject () | |
virtual | ~vtkObject () |
virtual void | RegisterInternal (vtkObjectBase *, int check) |
virtual void | UnRegisterInternal (vtkObjectBase *, int check) |
void | InternalGrabFocus (vtkCommand *mouseEvents, vtkCommand *keypressEvents=NULL) |
void | InternalReleaseFocus () |
![]() | |
vtkObjectBase () | |
virtual | ~vtkObjectBase () |
virtual void | CollectRevisions (ostream &) |
virtual void | ReportReferences (vtkGarbageCollector *) |
vtkObjectBase (const vtkObjectBase &) | |
void | operator= (const vtkObjectBase &) |
Additional Inherited Members | |
![]() | |
vtkGraphInternals * | Internals |
vtkDistributedGraphHelper * | DistributedHelper |
vtkGraphEdgePoints * | EdgePoints |
double | Bounds [6] |
vtkTimeStamp | ComputeTime |
vtkDataSetAttributes * | VertexData |
vtkDataSetAttributes * | EdgeData |
vtkPoints * | Points |
vtkIdTypeArray * | EdgeList |
![]() | |
vtkFieldData * | FieldData |
int | DataReleased |
vtkTimeStamp | UpdateTime |
vtkInformation * | Information |
![]() | |
bool | Debug |
vtkTimeStamp | MTime |
vtkSubjectHelper * | SubjectHelper |
![]() | |
vtkAtomicInt32 | ReferenceCount |
vtkWeakPointerBase ** | WeakPointers |
![]() | |
static double | DefaultPoint [3] |
An undirected graph.
vtkUndirectedGraph is a collection of vertices along with a collection of undirected edges (they connect two vertices in no particular order). ShallowCopy(), DeepCopy(), CheckedShallowCopy(), CheckedDeepCopy() accept instances of vtkUndirectedGraph and vtkMutableUndirectedGraph. GetOutEdges(v, it) and GetInEdges(v, it) return the same list of edges, which is the list of all edges which have a v as an endpoint. GetInDegree(v), GetOutDegree(v) and GetDegree(v) all return the full degree of vertex v.
vtkUndirectedGraph is read-only. To create an undirected graph, use an instance of vtkMutableUndirectedGraph, then you may set the structure to a vtkUndirectedGraph using ShallowCopy().
Definition at line 53 of file vtkUndirectedGraph.h.
Definition at line 57 of file vtkUndirectedGraph.h.
|
protected |
|
protected |
|
static |
|
static |
|
virtual |
Return 1 if this class is the same type of (or a subclass of) the named class. Returns 0 otherwise. This method works in combination with vtkTypeMacro found in vtkSetGet.h.
Reimplemented from vtkGraph.
Reimplemented in vtkMolecule, and vtkMutableUndirectedGraph.
|
static |
|
protectedvirtual |
Reimplemented from vtkGraph.
Reimplemented in vtkMolecule, and vtkMutableUndirectedGraph.
vtkUndirectedGraph* vtkUndirectedGraph::NewInstance | ( | ) | const |
|
virtual |
|
inlinevirtual |
Return what type of dataset this is.
Reimplemented from vtkGraph.
Reimplemented in vtkMolecule.
Definition at line 61 of file vtkUndirectedGraph.h.
Returns the full degree of the vertex.
Reimplemented from vtkGraph.
|
virtual |
Random-access method for retrieving the in edges of a vertex. For an undirected graph, this is the same as the out edges.
Reimplemented from vtkGraph.
|
inlinevirtual |
Random-access method for retrieving incoming edges to vertex v. The method fills the vtkGraphEdge instance with the id, source, and target of the edge. This method is provided for wrappers, GetInEdge(vtkIdType, vtkIdType) is preferred.
Reimplemented from vtkGraph.
Definition at line 79 of file vtkUndirectedGraph.h.
|
static |
Retrieve a graph from an information vector.
|
static |
Retrieve a graph from an information vector.
|
inlinevirtual |
Initialize the iterator to get the incoming edges to a vertex. For an undirected graph, this is all incident edges.
Reimplemented from vtkGraph.
Definition at line 94 of file vtkUndirectedGraph.h.
|
virtual |
Check the structure, and accept it if it is a valid undirected graph. This is public to allow the ToDirected/UndirectedGraph to work.
Implements vtkGraph.
|
protectedvirtual |
For iterators, returns the same edge list as GetOutEdges().
Reimplemented from vtkGraph.