COIN-OR::LEMON - Graph Library

Changeset 2450:719220885b90 in lemon-0.x


Ignore:
Timestamp:
06/05/07 19:27:54 (12 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3287
Message:

Negate the meaning of the delta parameter

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/circulation.h

    r2408 r2450  
    3838  ///for the Network Circulation Problem.
    3939  ///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]
    4141  /// \f[ lo(e)\leq x(e) \leq up(e) \quad \forall e\in E \f]
    4242  ///
     
    9696      _x=_lo;
    9797
    98       for(NodeIt n(_g);n!=INVALID;++n) _excess[n]=-_delta[n];
     98      for(NodeIt n(_g);n!=INVALID;++n) _excess[n]=_delta[n];
    9999
    100100      for(EdgeIt e(_g);e!=INVALID;++e)
     
    121121      for(NodeIt n(_g);n!=INVALID;++n)
    122122        {
    123           Value dif=_delta[n];
     123          Value dif=-_delta[n];
    124124          for(InEdgeIt e(_g,n);e!=INVALID;++e) dif-=x[e];
    125125          for(OutEdgeIt e(_g,n);e!=INVALID;++e) dif+=x[e];
     
    141141      for(NodeIt n(_g);n!=INVALID;++n)
    142142        if(bar[n])
    143           delta+=_delta[n];
     143          delta-=_delta[n];
    144144      for(EdgeIt e(_g);e!=INVALID;++e)
    145145        {
     
    280280   
    281281    ///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]
    283283    ///holds. The existence of a set with this property prooves that a feasible
    284284    ///flow cannot exists.
Note: See TracChangeset for help on using the changeset viewer.