equal
deleted
inserted
replaced
2203 } |
2203 } |
2204 |
2204 |
2205 void first(Node& i) const { _graph->first(i); } |
2205 void first(Node& i) const { _graph->first(i); } |
2206 void first(Arc& i) const { _graph->first(i); } |
2206 void first(Arc& i) const { _graph->first(i); } |
2207 void firstIn(Arc& i, const Node& n) const { |
2207 void firstIn(Arc& i, const Node& n) const { |
2208 bool d; |
2208 bool d = true; |
2209 _graph->firstInc(i, d, n); |
2209 _graph->firstInc(i, d, n); |
2210 while (i != INVALID && d == (*_direction)[i]) _graph->nextInc(i, d); |
2210 while (i != INVALID && d == (*_direction)[i]) _graph->nextInc(i, d); |
2211 } |
2211 } |
2212 void firstOut(Arc& i, const Node& n ) const { |
2212 void firstOut(Arc& i, const Node& n ) const { |
2213 bool d; |
2213 bool d = true; |
2214 _graph->firstInc(i, d, n); |
2214 _graph->firstInc(i, d, n); |
2215 while (i != INVALID && d != (*_direction)[i]) _graph->nextInc(i, d); |
2215 while (i != INVALID && d != (*_direction)[i]) _graph->nextInc(i, d); |
2216 } |
2216 } |
2217 |
2217 |
2218 void next(Node& i) const { _graph->next(i); } |
2218 void next(Node& i) const { _graph->next(i); } |