1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
/*=========================================================================
Program: Visualization Toolkit
Module: $RCSfile: vtkUndirectedGraph.h,v $
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
/*-------------------------------------------------------------------------
Copyright 2008 Sandia Corporation.
Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
the U.S. Government retains certain rights in this software.
-------------------------------------------------------------------------*/
// .NAME vtkUndirectedGraph - An undirected graph.
//
// .SECTION Description
// 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().
//
// .SECTION See Also
// vtkGraph vtkMutableUndirectedGraph
#ifndef __vtkUndirectedGraph_h
#define __vtkUndirectedGraph_h
#include "vtkGraph.h"
class VTK_FILTERING_EXPORT vtkUndirectedGraph : public vtkGraph
{
public:
static vtkUndirectedGraph *New();
vtkTypeRevisionMacro(vtkUndirectedGraph, vtkGraph);
void PrintSelf(ostream& os, vtkIndent indent);
// Description:
// Return what type of dataset this is.
virtual int GetDataObjectType() {return VTK_UNDIRECTED_GRAPH;}
// Description:
// Returns the full degree of the vertex.
virtual vtkIdType GetInDegree(vtkIdType v);
//BTX
// Description:
// Random-access method for retrieving the in edges of a vertex.
// For an undirected graph, this is the same as the out edges.
virtual vtkInEdgeType GetInEdge(vtkIdType v, vtkIdType i);
//ETX
// Description:
// 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.
virtual void GetInEdge(vtkIdType v, vtkIdType i, vtkGraphEdge* e)
{ this->Superclass::GetInEdge(v, i, e); }
//BTX
// Description:
// Retrieve a graph from an information vector.
static vtkUndirectedGraph *GetData(vtkInformation *info);
static vtkUndirectedGraph *GetData(vtkInformationVector *v, int i=0);
//ETX
// Description:
// Initialize the iterator to get the incoming edges to a vertex.
// For an undirected graph, this is all incident edges.
virtual void GetInEdges(vtkIdType v, vtkInEdgeIterator *it)
{ Superclass::GetInEdges(v, it); }
protected:
vtkUndirectedGraph();
~vtkUndirectedGraph();
// Description:
// Check the structure, and accept it if it is a valid
// undirected graph.
virtual bool IsStructureValid(vtkGraph *g);
//BTX
// Description:
// For iterators, returns the same edge list as GetOutEdges().
virtual void GetInEdges(vtkIdType v, const vtkInEdgeType *& edges, vtkIdType & nedges);
//ETX
private:
vtkUndirectedGraph(const vtkUndirectedGraph&); // Not implemented.
void operator=(const vtkUndirectedGraph&); // Not implemented.
};
#endif
|
