libopencascade-foundation-dev 6.5.0.dfsg-2build1 / usr / include / opencascade / GraphTools_ConnectedVerticesFromIterator.gxx

This file is indexed.

/usr/include/opencascade/GraphTools_ConnectedVerticesFromIterator.gxx is in libopencascade-foundation-dev 6.5.0.dfsg-2build1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below. 

  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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
// Copyright: 	Matra-Datavision 1992
// File:	GraphTools_ConnectedVerticesFromIterator.gxx
// Created:	Mon Oct 19 10:45:58 1992
// Author:	Arnaud BOUZY
//		<adn>

#include <Standard_NoSuchObject.hxx>
#include <Standard_NoMoreObject.hxx>


//=======================================================================
//function : GraphTools_ConnectedVerticesFromIterator
//purpose  : 
//=======================================================================

GraphTools_ConnectedVerticesFromIterator::GraphTools_ConnectedVerticesFromIterator()
{
  myCurrent = 0;
}


//=======================================================================
//function : FromVertex
//purpose  : 
//=======================================================================

void GraphTools_ConnectedVerticesFromIterator::FromVertex(const Vertex& avert)
{
  initMap.Add(avert);
}


//=======================================================================
//function : Reset
//purpose  : 
//=======================================================================

void GraphTools_ConnectedVerticesFromIterator::Reset ()
{
  myCurrent = 0;
  initMap.Clear();
}


//=======================================================================
//function : Perform
//purpose  : 
//=======================================================================

void GraphTools_ConnectedVerticesFromIterator::Perform (const Graph& aGraph)
{
  Standard_Integer nbvert = initMap.Extent();
  GraphTools_ConnectMap visited;
  Standard_Integer i;
  for (i=1;i<=nbvert; i++) {
    visited.Bind(initMap(i),i);
  }
  for (i=1;i<=nbvert; i++) {
    if (visited(initMap(i)) == i) {
      myCurrent = i;
      VIterator vit(aGraph,initMap(i));
      while (vit.More()) {
	Visit(vit.Value(),aGraph,visited);
	vit.Next();
      }
    }
  }

  tab = new TColStd_HArray1OfInteger(1,nbvert,0);
  for (i=1; i<= nbvert; i++) {
    tab->SetValue(i,visited(initMap(i)));
  }
  myCurrent = 0;
  Next();
}


//=======================================================================
//function : More
//purpose  : 
//=======================================================================

Standard_Boolean GraphTools_ConnectedVerticesFromIterator::More() const
{
  for (Standard_Integer i=1; i<= tab->Upper(); i++) {
    if (tab->Value(i) >= myCurrent) {
      return Standard_True;
    }
  }
  return Standard_False;
}


//=======================================================================
//function : Next
//purpose  : 
//=======================================================================

void GraphTools_ConnectedVerticesFromIterator::Next()
{
  Standard_Boolean found=Standard_False;
  myCurrent++;
  Standard_Integer nbv = tab->Upper();
  Standard_Integer i;
  while (!found && (myCurrent <= nbv)) {
    for (i=1; (i<= nbv) && !found; i++) {
      if (tab->Value(i) == myCurrent) {
	found = Standard_True;
      }
    }
    if (!found) {
      myCurrent++;
    }
  }
}


//=======================================================================
//function : NbVertices
//purpose  : 
//=======================================================================

Standard_Integer GraphTools_ConnectedVerticesFromIterator::NbVertices() const
{
  if (!More()) {
    Standard_NoSuchObject::Raise();
  }
  Standard_Integer res = 0;
  for (Standard_Integer i=1; i<= tab->Upper(); i++) {
    if (tab->Value(i) == myCurrent) {
      res++;
    }
  }
  return res;
}

//=======================================================================
//function : Value
//purpose  : 
//=======================================================================

const Vertex& GraphTools_ConnectedVerticesFromIterator::Value
  (const Standard_Integer index) const
{
  if (!More()) {
    Standard_NoSuchObject::Raise();
  }
  Standard_Integer current=0;
  for (Standard_Integer i=1; i<= tab->Upper(); i++) {
    if (tab->Value(i) == myCurrent) {
      current++;
      if (current == index) {
	return initMap(i);
      }
    }
  }
}

//=======================================================================
//function : Visit
//purpose  : 
//=======================================================================

void GraphTools_ConnectedVerticesFromIterator::Visit
  (const Vertex& avert,
   const Graph& agraph, 
   GraphTools_ConnectMap& visited)
{
  Standard_Boolean godown = Standard_False;
  if (!visited.IsBound(avert)) {
    visited.Bind(avert,myCurrent);
    godown = Standard_True;
  }
  else {
    Standard_Integer thebound = visited(avert);
    if (thebound > myCurrent) {
      visited(avert) = myCurrent;
      godown = Standard_True;
    }
    else if (thebound < myCurrent) {
      Standard_Integer rebind = visited(initMap(thebound));
      for (Standard_Integer i=1; i <= initMap.Extent(); i++) {
	if ((visited(initMap(i)) == thebound) || 
	    (visited(initMap(i)) == rebind)) {
	  visited(initMap(i)) = myCurrent;
	}
      }
    }
  }
  if (godown) {
    VIterator vit(agraph,avert);
    while (vit.More()) {
      Visit(vit.Value(),agraph,visited);
      vit.Next();
    }
  }
}

APT Browse - Built by Thomas Orozco.