equal
deleted
inserted
replaced
732 |
732 |
733 void firstIn(Edge& i, const Node& n) const { |
733 void firstIn(Edge& i, const Node& n) const { |
734 Parent::firstIn(i, n); |
734 Parent::firstIn(i, n); |
735 i.backward=false; |
735 i.backward=false; |
736 while (*static_cast<GraphEdge*>(&i)!=INVALID && |
736 while (*static_cast<GraphEdge*>(&i)!=INVALID && |
737 !(*forward_filter)[i]) Parent::nextOut(i); |
737 !(*forward_filter)[i]) Parent::nextIn(i); |
738 if (*static_cast<GraphEdge*>(&i)==INVALID) { |
738 if (*static_cast<GraphEdge*>(&i)==INVALID) { |
739 Parent::firstOut(i, n); |
739 Parent::firstOut(i, n); |
740 i.backward=true; |
740 i.backward=true; |
741 while (*static_cast<GraphEdge*>(&i)!=INVALID && |
741 while (*static_cast<GraphEdge*>(&i)!=INVALID && |
742 !(*backward_filter)[i]) Parent::nextOut(i); |
742 !(*backward_filter)[i]) Parent::nextOut(i); |