VTK
|
A directed graph. More...
#include <vtkDirectedGraph.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 |
vtkDirectedGraph () | |
~vtkDirectedGraph () | |
![]() | |
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 void | GetInEdges (vtkIdType v, const vtkInEdgeType *&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] |
A directed graph.
vtkDirectedGraph is a collection of vertices along with a collection of directed edges (edges that have a source and target). ShallowCopy() and DeepCopy() (and CheckedShallowCopy(), CheckedDeepCopy()) accept instances of vtkTree and vtkMutableDirectedGraph.
vtkDirectedGraph is read-only. To create an undirected graph, use an instance of vtkMutableDirectedGraph, then you may set the structure to a vtkDirectedGraph using ShallowCopy().
Including this header allows you to use a vtkDirectedGraph* in boost algorithms. To do this, first wrap the class in a vtkDirectedGraph* or vtkUndirectedGraph* depending on whether your graph is directed or undirected. You may then use these objects directly in boost graph algorithms.
Definition at line 46 of file vtkDirectedGraph.h.
typedef vtkGraph vtkDirectedGraph::Superclass |
Definition at line 50 of file vtkDirectedGraph.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 vtkReebGraph, vtkTree, vtkDirectedAcyclicGraph, and vtkMutableDirectedGraph.
|
static |
|
protectedvirtual |
Reimplemented from vtkGraph.
Reimplemented in vtkReebGraph, vtkTree, vtkDirectedAcyclicGraph, and vtkMutableDirectedGraph.
vtkDirectedGraph* vtkDirectedGraph::NewInstance | ( | ) | const |
|
virtual |
Methods invoked by print to print information about the object including superclasses. Typically not called by the user (use Print() instead) but used in the hierarchical print process to combine the output of several classes.
Reimplemented from vtkDataObject.
Reimplemented in vtkReebGraph, vtkTree, and vtkMutableDirectedGraph.
|
inlinevirtual |
Return what type of dataset this is.
Reimplemented from vtkGraph.
Reimplemented in vtkReebGraph, vtkTree, and vtkDirectedAcyclicGraph.
Definition at line 54 of file vtkDirectedGraph.h.
|
static |
Retrieve a graph from an information vector.
|
static |
Retrieve a graph from an information vector.
|
virtual |
Check the storage, and accept it if it is a valid undirected graph. This is public to allow the ToDirected/UndirectedGraph to work.
Implements vtkGraph.
Reimplemented in vtkTree, and vtkDirectedAcyclicGraph.