72 |
|
|
73 |
size_t cellNumber = (*i).value(); |
size_t cellNumber = (*i).value(); |
74 |
|
|
75 |
MeshOfHexahedra::const_iterator h0 = &(this->cell(cellNumber)); |
MeshOfHexahedra::const_iterator h0(*this, cellNumber); |
76 |
|
|
77 |
bool found=false; |
bool found=false; |
78 |
|
|
82 |
|
|
83 |
toVisitSet.insert(h0); |
toVisitSet.insert(h0); |
84 |
toVisitStack.push(h0); |
toVisitStack.push(h0); |
85 |
const Hexahedron* h; |
MeshOfHexahedra::const_iterator h(*this); |
86 |
size_t numberOfCell = 1; |
size_t numberOfCell = 1; |
87 |
do { |
do { |
88 |
fferr(0) << "Visiting cell n°" << numberOfCell++ << '\n'; |
fferr(0) << "Visiting cell n°" << numberOfCell++ << '\n'; |
132 |
|
|
133 |
for (size_t k=0; k<6; ++k) { |
for (size_t k=0; k<6; ++k) { |
134 |
if (neighbours[k]) { |
if (neighbours[k]) { |
135 |
h=(*__connectivity)(cellNumber)[k]; |
h = (*__connectivity)(cellNumber)[k]; |
136 |
if (h!=0) |
if (not(h.end())) { |
137 |
if (visited.find(h) == visited.end()) { |
if (visited.find(h) == visited.end()) { |
138 |
if (toVisitSet.find(h) == toVisitSet.end()) { |
if (toVisitSet.find(h) == toVisitSet.end()) { |
139 |
toVisitSet.insert(h); |
toVisitSet.insert(h); |
140 |
toVisitStack.push(h); |
toVisitStack.push(h); |
141 |
} |
} |
142 |
} |
} |
143 |
|
} |
144 |
} |
} |
145 |
} |
} |
146 |
} |
} |