Changeset 1158:29961fa390a3 in lemon0.x for src/lemon/max_matching.h
 Timestamp:
 02/20/05 02:02:07 (16 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@1559
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/lemon/max_matching.h
r1093 r1158 181 181 Node u=_mate[v]; 182 182 for(IncEdgeIt e(g,v); e!=INVALID; ++e) { 183 if ( g. target(e) == u ) {183 if ( g.runningNode(e) == u ) { 184 184 map.set(u,e); 185 185 map.set(v,e); … … 228 228 Node u=_mate[v]; 229 229 for(IncEdgeIt e(g,v); e!=INVALID; ++e) { 230 if ( g. target(e) == u ) {230 if ( g.runningNode(e) == u ) { 231 231 map.set(e,true); 232 232 todo.set(u,false); … … 333 333 334 334 for( IncEdgeIt e(g,x); e!=INVALID ; ++e ) { 335 Node y=g. target(e);335 Node y=g.runningNode(e); 336 336 337 337 if ( position[y] == D && blossom.find(x) != blossom.find(y) ) { … … 389 389 390 390 for( IncEdgeIt e(g,x); e!=INVALID; ++e ) { 391 Node y=g. target(e);391 Node y=g.runningNode(e); 392 392 393 393 switch ( position[y] ) { … … 454 454 if ( _mate[v]==INVALID ) { 455 455 for( IncEdgeIt e(g,v); e!=INVALID ; ++e ) { 456 Node y=g. target(e);456 Node y=g.runningNode(e); 457 457 if ( _mate[y]==INVALID && y!=v ) { 458 458 _mate.set(v,y); … … 485 485 UFE& blossom, UFE& tree, std::queue<Node>& Q) { 486 486 for( IncEdgeIt e(g,x); e!= INVALID; ++e ) { 487 Node y=g. target(e);487 Node y=g.runningNode(e); 488 488 489 489 if ( position[y]==C ) {
Note: See TracChangeset
for help on using the changeset viewer.