# Changeset 101:d2ac583ed195 in lemon-0.x for src/work/jacint

Ignore:
Timestamp:
02/18/04 22:50:45 (20 years ago)
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@131
Message:

another heuristic

Location:
src/work/jacint
Files:
1 added
2 edited

Unmodified
Added
Removed
• ## src/work/jacint/preflow_hl2.h

 r98 TMap excess(G); std::vector numb(n+1); std::vector numb(n); /* The number of nodes on level i < n. It is for(OutEdgeIt e=G.template first(s); e.valid(); ++e) { if ( capacity.get(e) == 0 ) continue; T c=capacity.get(e); if ( c == 0 ) continue; NodeIt w=G.head(e); if ( w!=s ) { if ( excess.get(w) == 0 && w!=t ) stack[level.get(w)].push(w); flow.set(e, capacity.get(e)); excess.set(w, excess.get(w)+capacity.get(e)); } flow.set(e, c); excess.set(w, excess.get(w)+c); } } int lev=level.get(w); int exc=excess.get(w); int newlevel=2*n-2;      //In newlevel we bound the next level of w. int newlevel=2*n;      //In newlevel we bound the next level of w. //  if ( level.get(w) < n ) { //Nem tudom ez mukodik-e
• ## src/work/jacint/preflow_push_hl.h

 r97 // -*- C++ -*- //kerdesek: nem tudom lehet-e a //kieleket csak a legf n szintu pontokra nezni. /* preflow_push_hl.h for(OutEdgeIt e=G.template first(s); e.valid(); ++e) { if ( capacity.get(e) == 0 ) continue; T c=capacity.get(e); if ( c == 0 ) continue; NodeIt w=G.head(e); if ( w!=s ) { if ( excess.get(w) == 0 && w!=t ) stack[level.get(w)].push(w); flow.set(e, capacity.get(e)); excess.set(w, excess.get(w)+capacity.get(e)); flow.set(e, c); excess.set(w, excess.get(w)+c); } } int lev=level.get(w); int exc=excess.get(w); int newlevel=2*n-2;      //In newlevel we bound the next level of w. int newlevel=2*n;      //In newlevel we bound the next level of w. //vagy MAXINT //  if ( level.get(w) < n ) { //Nem tudom ez mukodik-e for(OutEdgeIt e=G.template first(w); e.valid(); ++e) {
Note: See TracChangeset for help on using the changeset viewer.