equal
deleted
inserted
replaced
157 todo.set(v,false); |
157 todo.set(v,false); |
158 while (!Q.empty()) { |
158 while (!Q.empty()) { |
159 Node w=Q.front(); |
159 Node w=Q.front(); |
160 Q.pop(); |
160 Q.pop(); |
161 for(IncEdgeIt e(g,w); e!=INVALID; ++e) { |
161 for(IncEdgeIt e(g,w); e!=INVALID; ++e) { |
162 Node u=g.target(e); |
162 Node u=g.runningNode(e); |
163 if ( pos[u]==max_matching.D && todo[u] ) { |
163 if ( pos[u]==max_matching.D && todo[u] ) { |
164 ++comp_size; |
164 ++comp_size; |
165 Q.push(u); |
165 Q.push(u); |
166 todo.set(u,false); |
166 todo.set(u,false); |
167 } |
167 } |