Changeset 986:e997802b855c in lemon-0.x for src/work/jacint/preflow_excess_test.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/preflow_excess_test.cc
r921 r986 53 53 EdgeIt e; 54 54 for(G.first(e); G.valid(e); G.next(e)) { 55 if (mincut[G. tail(e)] && !mincut[G.head(e)]) min_min_cut_value+=cap[e];55 if (mincut[G.source(e)] && !mincut[G.target(e)]) min_min_cut_value+=cap[e]; 56 56 } 57 57 … … 60 60 int min_cut_value=0; 61 61 for(G.first(e); G.valid(e); G.next(e)) { 62 if (cut[G. tail(e)] && !cut[G.head(e)])62 if (cut[G.source(e)] && !cut[G.target(e)]) 63 63 min_cut_value+=cap[e]; 64 64 } … … 68 68 int max_min_cut_value=0; 69 69 for(G.first(e); G.valid(e); G.next(e)) { 70 if (maxcut[G. tail(e)] && !maxcut[G.head(e)])70 if (maxcut[G.source(e)] && !maxcut[G.target(e)]) 71 71 max_min_cut_value+=cap[e]; 72 72 } … … 100 100 int min_min_cut_value2=0; 101 101 for(G.first(e); G.valid(e); G.next(e)) { 102 if (mincut2[G. tail(e)] && !mincut2[G.head(e)]) min_min_cut_value2+=cap[e];102 if (mincut2[G.source(e)] && !mincut2[G.target(e)]) min_min_cut_value2+=cap[e]; 103 103 } 104 104 … … 107 107 int min_cut_value2=0; 108 108 for(G.first(e); G.valid(e); G.next(e)) { 109 if (cut2[G. tail(e)] && !cut2[G.head(e)])109 if (cut2[G.source(e)] && !cut2[G.target(e)]) 110 110 min_cut_value2+=cap[e]; 111 111 } … … 115 115 int max_min_cut_value2=0; 116 116 for(G.first(e); G.valid(e); G.next(e)) { 117 if (maxcut2[G. tail(e)] && !maxcut2[G.head(e)])117 if (maxcut2[G.source(e)] && !maxcut2[G.target(e)]) 118 118 max_min_cut_value2+=cap[e]; 119 119 } … … 145 145 int min_min_cut_value3=0; 146 146 for(G.first(e); G.valid(e); G.next(e)) { 147 if (mincut3[G. tail(e)] && !mincut3[G.head(e)]) min_min_cut_value3+=cap[e];147 if (mincut3[G.source(e)] && !mincut3[G.target(e)]) min_min_cut_value3+=cap[e]; 148 148 } 149 149 … … 152 152 int min_cut_value3=0; 153 153 for(G.first(e); G.valid(e); G.next(e)) { 154 if (cut3[G. tail(e)] && !cut3[G.head(e)])154 if (cut3[G.source(e)] && !cut3[G.target(e)]) 155 155 min_cut_value3+=cap[e]; 156 156 } … … 160 160 int max_min_cut_value3=0; 161 161 for(G.first(e); G.valid(e); G.next(e)) { 162 if (maxcut3[G. tail(e)] && !maxcut3[G.head(e)])162 if (maxcut3[G.source(e)] && !maxcut3[G.target(e)]) 163 163 max_min_cut_value3+=cap[e]; 164 164 }
Note: See TracChangeset
for help on using the changeset viewer.