while ( _excess[_excess_nodes[next_node]] > 0 ||

       while ( _excess[_excess_nodes[next_node]] > 0 ||

               ++next_node < int(_excess_nodes.size()) )

               ++next_node < int(_excess_nodes.size()) )

       {

       {

         // Running Dijkstra

         // Running Dijkstra

         s = _excess_nodes[next_node];

         s = _excess_nodes[next_node];

         // Augmenting along a shortest path from s to t

         // Augmenting along a shortest path from s to t

         Capacity d = std::min(_excess[s], -_excess[t]);

         Capacity d = std::min(_excess[s], -_excess[t]);

         Node u = t;

         Node u = t;

         Edge e;

         Edge e;