Changeset 986:e997802b855c in lemon-0.x for src/work/jacint/max_flow_bug.cc
- Timestamp:
- 11/13/04 13:53:28 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1376
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/work/jacint/max_flow_bug.cc
r921 r986 43 43 EdgeIt e; 44 44 for(G.first(e); G.valid(e); G.next(e)) { 45 if (mincut[G. tail(e)] && !mincut[G.head(e)]) min_min_cut_value+=cap[e];45 if (mincut[G.source(e)] && !mincut[G.target(e)]) min_min_cut_value+=cap[e]; 46 46 } 47 47 … … 50 50 int min_cut_value=0; 51 51 for(G.first(e); G.valid(e); G.next(e)) { 52 if (cut[G. tail(e)] && !cut[G.head(e)])52 if (cut[G.source(e)] && !cut[G.target(e)]) 53 53 min_cut_value+=cap[e]; 54 54 } … … 58 58 int max_min_cut_value=0; 59 59 for(G.first(e); G.valid(e); G.next(e)) { 60 if (maxcut[G. tail(e)] && !maxcut[G.head(e)])60 if (maxcut[G.source(e)] && !maxcut[G.target(e)]) 61 61 max_min_cut_value+=cap[e]; 62 62 } … … 89 89 int min_min_cut_value2=0; 90 90 for(G.first(e); G.valid(e); G.next(e)) { 91 if (mincut2[G. tail(e)] && !mincut2[G.head(e)]) min_min_cut_value2+=cap[e];91 if (mincut2[G.source(e)] && !mincut2[G.target(e)]) min_min_cut_value2+=cap[e]; 92 92 } 93 93 … … 96 96 int min_cut_value2=0; 97 97 for(G.first(e); G.valid(e); G.next(e)) { 98 if (cut2[G. tail(e)] && !cut2[G.head(e)])98 if (cut2[G.source(e)] && !cut2[G.target(e)]) 99 99 min_cut_value2+=cap[e]; 100 100 } … … 104 104 int max_min_cut_value2=0; 105 105 for(G.first(e); G.valid(e); G.next(e)) { 106 if (maxcut2[G. tail(e)] && !maxcut2[G.head(e)])106 if (maxcut2[G.source(e)] && !maxcut2[G.target(e)]) 107 107 max_min_cut_value2+=cap[e]; 108 108 } … … 128 128 int min_min_cut_value3=0; 129 129 for(G.first(e); G.valid(e); G.next(e)) { 130 if (mincut3[G. tail(e)] && !mincut3[G.head(e)]) min_min_cut_value3+=cap[e];130 if (mincut3[G.source(e)] && !mincut3[G.target(e)]) min_min_cut_value3+=cap[e]; 131 131 } 132 132 … … 135 135 int min_cut_value3=0; 136 136 for(G.first(e); G.valid(e); G.next(e)) { 137 if (cut3[G. tail(e)] && !cut3[G.head(e)])137 if (cut3[G.source(e)] && !cut3[G.target(e)]) 138 138 min_cut_value3+=cap[e]; 139 139 } … … 143 143 int max_min_cut_value3=0; 144 144 for(G.first(e); G.valid(e); G.next(e)) { 145 if (maxcut3[G. tail(e)] && !maxcut3[G.head(e)])145 if (maxcut3[G.source(e)] && !maxcut3[G.target(e)]) 146 146 max_min_cut_value3+=cap[e]; 147 147 }
Note: See TracChangeset
for help on using the changeset viewer.