| 271 | } |
| 272 | |
| 273 | void inc() |
| 274 | { |
| 275 | ++iter; |
| 276 | if (iter == end) |
| 277 | { |
| 278 | // Find a vertex with nonzero out degree. |
| 279 | ++vertex; |
| 280 | while (vertex < lastVertex && this->graph->GetOutDegree(vertex) == 0) |
| 281 | { |
| 282 | ++vertex; |
| 283 | } |
| 284 | |
| 285 | if (vertex < lastVertex) |
| 286 | { |
| 287 | vtkIdType nedges; |
| 288 | graph->GetOutEdges(vertex, iter, nedges); |
| 289 | end = iter + nedges; |
| 290 | } |
| 291 | else |
| 292 | { |
| 293 | iter = nullptr; |
| 294 | } |
| 295 | } |
| 296 | } |
| 297 | |
| 298 | void RecalculateEdge() |
| 299 | { |
no test coverage detected