/*

     This file is part of Combean.

     Combean is free software; you can redistribute it and/or modify

     it under the terms of the GNU General Public License as published by

     the Free Software Foundation; either version 2 of the License, or

     (at your option) any later version.

     Combean is distributed in the hope that it will be useful,

     but WITHOUT ANY WARRANTY; without even the implied warranty of

     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

     GNU General Public License for more details.

     You should have received a copy of the GNU General Public License

     along with Combean; if not, write to the Free Software

     Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA

 */

 /*

  * Created on 30.08.2005

  *

  */

 package net.sourceforge.combean.interfaces.graph.alg.flow;

 import net.sourceforge.combean.interfaces.graph.containers.doubleval.FixedDoubleNodeMap;

 /**

  * A flow algorithm for finding a feasible flow with given flow balance

  * for each node (if one exists).

  * 

  * @author schickin

  *

  */

 public interface FeasibleFlowAlg extends AbstractFlowAlg {

     /**

      * Set the inflow at each node in the graph.

      * A positive value means that additional flow is injected at the node,

      * whereas a negative value represents the fact that flow is drained

      * from the network. If this map is not set, the flow balance at each

      * node is assumed to be zero, i.e., inbound equals outbound flow.

      * 

      * @param inflowMap the inflow at each node.

      */

     public void setInflowMap(FixedDoubleNodeMap inflowMap);

     /**

      * Check if a feasible flow exists. May only be called after the

      * algorithm has been executed.

      * 

      * @return true if a feasible flow exists.

      */

     boolean isFeasible();

 }