| ... | ... |
@@ -2202,18 +2202,18 @@ |
| 2202 | 2202 |
_direction->set(arc, !(*_direction)[arc]); |
| 2203 | 2203 |
} |
| 2204 | 2204 |
|
| 2205 | 2205 |
void first(Node& i) const { _graph->first(i); }
|
| 2206 | 2206 |
void first(Arc& i) const { _graph->first(i); }
|
| 2207 | 2207 |
void firstIn(Arc& i, const Node& n) const {
|
| 2208 |
bool d; |
|
| 2208 |
bool d = true; |
|
| 2209 | 2209 |
_graph->firstInc(i, d, n); |
| 2210 | 2210 |
while (i != INVALID && d == (*_direction)[i]) _graph->nextInc(i, d); |
| 2211 | 2211 |
} |
| 2212 | 2212 |
void firstOut(Arc& i, const Node& n ) const {
|
| 2213 |
bool d; |
|
| 2213 |
bool d = true; |
|
| 2214 | 2214 |
_graph->firstInc(i, d, n); |
| 2215 | 2215 |
while (i != INVALID && d != (*_direction)[i]) _graph->nextInc(i, d); |
| 2216 | 2216 |
} |
| 2217 | 2217 |
|
| 2218 | 2218 |
void next(Node& i) const { _graph->next(i); }
|
| 2219 | 2219 |
void next(Arc& i) const { _graph->next(i); }
|
0 comments (0 inline)