/* -*- mode: C++; indent-tabs-mode: nil; -*-

 /* -*- mode: C++; indent-tabs-mode: nil; -*-

  *

  *

  * This file is a part of LEMON, a generic C++ optimization library.

  * This file is a part of LEMON, a generic C++ optimization library.

  *

  *

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  * (Egervary Research Group on Combinatorial Optimization, EGRES).

  *

  *

  * Permission to use, modify and distribute this software is granted

  * Permission to use, modify and distribute this software is granted

  * provided that this copyright notice appears in all copies. For

  * provided that this copyright notice appears in all copies. For

           if ((*_level)[v] == _level->maxLevel()) continue;

           if ((*_level)[v] == _level->maxLevel()) continue;

           _flow->set(e, 0);

           _flow->set(e, 0);

           (*_excess)[v] += rem;

           (*_excess)[v] += rem;

         }

         }

       }

       }

         if(n!=_source && n!=_target && _tolerance.positive((*_excess)[n]))

         if(n!=_source && n!=_target && _tolerance.positive((*_excess)[n]))

           _level->activate(n);

           _level->activate(n);

       return true;

       return true;

     }

     }

     /// \brief Starts the first phase of the preflow algorithm.

     /// \brief Starts the first phase of the preflow algorithm.

     ///

     ///

         while (num > 0) {

         while (num > 0) {

           n = _level->highestActive();

           n = _level->highestActive();

           if (n == INVALID) goto first_phase_done;

           if (n == INVALID) goto first_phase_done;

           level = _level->highestActiveLevel();

           level = _level->highestActiveLevel();

           --num;

           --num;

           Value excess = (*_excess)[n];

           Value excess = (*_excess)[n];

           int new_level = _level->maxLevel();

           int new_level = _level->maxLevel();

           for (OutArcIt e(_graph, n); e != INVALID; ++e) {

           for (OutArcIt e(_graph, n); e != INVALID; ++e) {

             Value rem = (*_capacity)[e] - (*_flow)[e];

             Value rem = (*_capacity)[e] - (*_flow)[e];