Changeset 2512:371cf309fc3c in lemon-0.x for lemon/pr_bipartite_matching.h
- Timestamp:
- 11/14/07 18:44:42 (17 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3377
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/pr_bipartite_matching.h
r2466 r2512 180 180 if(nlevel<_node_num) { 181 181 if(nlevel>=actlevel) 182 _levels.liftHighestActive To(nlevel+1);182 _levels.liftHighestActive(nlevel+1); 183 183 bact=_g.bNode(_matching[_g.aNode(bedge)]); 184 184 if(--_cov[bact]<1) { … … 191 191 } 192 192 else { 193 if(_node_num>actlevel) 194 _levels.liftHighestActiveTo(_node_num); 195 _levels.deactivate(act); 196 } 197 198 if(_levels.onLevel(actlevel)==0) 193 _levels.liftHighestActiveToTop(); 194 } 195 196 if(_levels.emptyLevel(actlevel)) 199 197 _levels.liftToTop(actlevel); 200 198 } … … 247 245 if(nlevel<_node_num) { 248 246 if(nlevel>=actlevel) 249 _levels.liftHighestActive To(nlevel+1);247 _levels.liftHighestActive(nlevel+1); 250 248 bact=_g.bNode(_matching[_g.aNode(bedge)]); 251 249 if(--_cov[bact]<1) { … … 258 256 } 259 257 else { 260 if(_node_num>actlevel) 261 _levels.liftHighestActiveTo(_node_num); 262 _levels.deactivate(act); 263 } 264 265 if(_levels.onLevel(actlevel)==0) 258 _levels.liftHighestActiveToTop(); 259 } 260 261 if(_levels.emptyLevel(actlevel)) 266 262 _empty_level=actlevel; 267 263 return false;
Note: See TracChangeset
for help on using the changeset viewer.