Changeset 2450:719220885b90 in lemon0.x for lemon/circulation.h
 Timestamp:
 06/05/07 19:27:54 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3287
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/circulation.h
r2408 r2450 38 38 ///for the Network Circulation Problem. 39 39 ///The exact formulation of this problem is the following. 40 /// \f[\sum_{e\in\rho(v)}x(e)\sum_{e\in\delta(v)}x(e)\leq delta(v)\quad \forall v\in V \f]40 /// \f[\sum_{e\in\rho(v)}x(e)\sum_{e\in\delta(v)}x(e)\leq delta(v)\quad \forall v\in V \f] 41 41 /// \f[ lo(e)\leq x(e) \leq up(e) \quad \forall e\in E \f] 42 42 /// … … 96 96 _x=_lo; 97 97 98 for(NodeIt n(_g);n!=INVALID;++n) _excess[n]= _delta[n];98 for(NodeIt n(_g);n!=INVALID;++n) _excess[n]=_delta[n]; 99 99 100 100 for(EdgeIt e(_g);e!=INVALID;++e) … … 121 121 for(NodeIt n(_g);n!=INVALID;++n) 122 122 { 123 Value dif= _delta[n];123 Value dif=_delta[n]; 124 124 for(InEdgeIt e(_g,n);e!=INVALID;++e) dif=x[e]; 125 125 for(OutEdgeIt e(_g,n);e!=INVALID;++e) dif+=x[e]; … … 141 141 for(NodeIt n(_g);n!=INVALID;++n) 142 142 if(bar[n]) 143 delta +=_delta[n];143 delta=_delta[n]; 144 144 for(EdgeIt e(_g);e!=INVALID;++e) 145 145 { … … 280 280 281 281 ///Barrier is a set \e B of nodes for which 282 /// \f[ \sum_{v\in B} delta(v)<\sum_{e\in\rho(B)}lo(e)\sum_{e\in\delta(B)}up(e) \f]282 /// \f[ \sum_{v\in B}delta(v)<\sum_{e\in\rho(B)}lo(e)\sum_{e\in\delta(B)}up(e) \f] 283 283 ///holds. The existence of a set with this property prooves that a feasible 284 284 ///flow cannot exists.
Note: See TracChangeset
for help on using the changeset viewer.