Changeset 986:e997802b855c in lemon-0.x for src/work/jacint/max_flow_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/max_flow_test.cc
r921 r986 46 46 EdgeIt e; 47 47 for(G.first(e); G.valid(e); G.next(e)) { 48 if (mincut[G. tail(e)] && !mincut[G.head(e)]) min_min_cut_value+=cap[e];48 if (mincut[G.source(e)] && !mincut[G.target(e)]) min_min_cut_value+=cap[e]; 49 49 } 50 50 … … 53 53 int min_cut_value=0; 54 54 for(G.first(e); G.valid(e); G.next(e)) { 55 if (cut[G. tail(e)] && !cut[G.head(e)])55 if (cut[G.source(e)] && !cut[G.target(e)]) 56 56 min_cut_value+=cap[e]; 57 57 } … … 61 61 int max_min_cut_value=0; 62 62 for(G.first(e); G.valid(e); G.next(e)) { 63 if (maxcut[G. tail(e)] && !maxcut[G.head(e)])63 if (maxcut[G.source(e)] && !maxcut[G.target(e)]) 64 64 max_min_cut_value+=cap[e]; 65 65 } … … 92 92 int min_min_cut_value2=0; 93 93 for(G.first(e); G.valid(e); G.next(e)) { 94 if (mincut2[G. tail(e)] && !mincut2[G.head(e)]) min_min_cut_value2+=cap[e];94 if (mincut2[G.source(e)] && !mincut2[G.target(e)]) min_min_cut_value2+=cap[e]; 95 95 } 96 96 … … 99 99 int min_cut_value2=0; 100 100 for(G.first(e); G.valid(e); G.next(e)) { 101 if (cut2[G. tail(e)] && !cut2[G.head(e)])101 if (cut2[G.source(e)] && !cut2[G.target(e)]) 102 102 min_cut_value2+=cap[e]; 103 103 } … … 107 107 int max_min_cut_value2=0; 108 108 for(G.first(e); G.valid(e); G.next(e)) { 109 if (maxcut2[G. tail(e)] && !maxcut2[G.head(e)])109 if (maxcut2[G.source(e)] && !maxcut2[G.target(e)]) 110 110 max_min_cut_value2+=cap[e]; 111 111 } … … 131 131 int min_min_cut_value3=0; 132 132 for(G.first(e); G.valid(e); G.next(e)) { 133 if (mincut3[G. tail(e)] && !mincut3[G.head(e)]) min_min_cut_value3+=cap[e];133 if (mincut3[G.source(e)] && !mincut3[G.target(e)]) min_min_cut_value3+=cap[e]; 134 134 } 135 135 … … 138 138 int min_cut_value3=0; 139 139 for(G.first(e); G.valid(e); G.next(e)) { 140 if (cut3[G. tail(e)] && !cut3[G.head(e)])140 if (cut3[G.source(e)] && !cut3[G.target(e)]) 141 141 min_cut_value3+=cap[e]; 142 142 } … … 146 146 int max_min_cut_value3=0; 147 147 for(G.first(e); G.valid(e); G.next(e)) { 148 if (maxcut3[G. tail(e)] && !maxcut3[G.head(e)])148 if (maxcut3[G.source(e)] && !maxcut3[G.target(e)]) 149 149 max_min_cut_value3+=cap[e]; 150 150 }
Note: See TracChangeset
for help on using the changeset viewer.