1.1 --- a/doc/min_cost_flow.dox	Sun Nov 15 19:57:02 2009 +0100
     1.2 +++ b/doc/min_cost_flow.dox	Wed Nov 18 14:38:02 2009 +0100
     1.3 @@ -78,7 +78,7 @@
     1.4     - if \f$lower(uv)<f(uv)<upper(uv)\f$, then \f$cost^\pi(uv)=0\f$;
     1.5     - if \f$cost^\pi(uv)<0\f$, then \f$f(uv)=upper(uv)\f$.
     1.6   - For all \f$u\in V\f$ nodes:
     1.7 -   - \f$\pi(u)<=0\f$;
     1.8 +   - \f$\pi(u)\leq 0\f$;
     1.9     - if \f$\sum_{uv\in A} f(uv) - \sum_{vu\in A} f(vu) \neq sup(u)\f$,
    1.10       then \f$\pi(u)=0\f$.
    1.11   
    1.12 @@ -145,7 +145,7 @@
    1.13     - if \f$lower(uv)<f(uv)<upper(uv)\f$, then \f$cost^\pi(uv)=0\f$;
    1.14     - if \f$cost^\pi(uv)<0\f$, then \f$f(uv)=upper(uv)\f$.
    1.15   - For all \f$u\in V\f$ nodes:
    1.16 -   - \f$\pi(u)>=0\f$;
    1.17 +   - \f$\pi(u)\geq 0\f$;
    1.18     - if \f$\sum_{uv\in A} f(uv) - \sum_{vu\in A} f(vu) \neq sup(u)\f$,
    1.19       then \f$\pi(u)=0\f$.
    1.20