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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkInEdgeIterator.cxx
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.
-------------------------------------------------------------------------*/
#include "vtkInEdgeIterator.h"
#include "vtkObjectFactory.h"
#include "vtkGraph.h"
#include "vtkGraphEdge.h"
vtkCxxSetObjectMacro(vtkInEdgeIterator, Graph, vtkGraph);
vtkStandardNewMacro(vtkInEdgeIterator);
//----------------------------------------------------------------------------
vtkInEdgeIterator::vtkInEdgeIterator()
{
this->Vertex = 0;
this->Current = 0;
this->End = 0;
this->Graph = 0;
this->GraphEdge = 0;
}
//----------------------------------------------------------------------------
vtkInEdgeIterator::~vtkInEdgeIterator()
{
if (this->Graph)
{
this->Graph->Delete();
}
if (this->GraphEdge)
{
this->GraphEdge->Delete();
}
}
//----------------------------------------------------------------------------
void vtkInEdgeIterator::Initialize(vtkGraph *graph, vtkIdType v)
{
this->SetGraph(graph);
this->Vertex = v;
vtkIdType nedges;
this->Graph->GetInEdges(this->Vertex, this->Current, nedges);
this->End = this->Current + nedges;
}
//----------------------------------------------------------------------------
vtkGraphEdge *vtkInEdgeIterator::NextGraphEdge()
{
vtkInEdgeType e = this->Next();
if (!this->GraphEdge)
{
this->GraphEdge = vtkGraphEdge::New();
}
this->GraphEdge->SetSource(e.Source);
this->GraphEdge->SetTarget(this->Vertex);
this->GraphEdge->SetId(e.Id);
return this->GraphEdge;
}
//----------------------------------------------------------------------------
void vtkInEdgeIterator::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os,indent);
os << indent << "Graph: " << (this->Graph ? "" : "(null)") << endl;
if (this->Graph)
{
this->Graph->PrintSelf(os, indent.GetNextIndent());
}
os << indent << "Vertex: " << this->Vertex << endl;
}
|
