| Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
| MaxFlowAlg |
|
| 1.0;1 |
| 1 | /* | |
| 2 | This file is part of Combean. | |
| 3 | ||
| 4 | Combean is free software; you can redistribute it and/or modify | |
| 5 | it under the terms of the GNU General Public License as published by | |
| 6 | the Free Software Foundation; either version 2 of the License, or | |
| 7 | (at your option) any later version. | |
| 8 | ||
| 9 | Combean is distributed in the hope that it will be useful, | |
| 10 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 11 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
| 12 | GNU General Public License for more details. | |
| 13 | ||
| 14 | You should have received a copy of the GNU General Public License | |
| 15 | along with Combean; if not, write to the Free Software | |
| 16 | Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
| 17 | */ | |
| 18 | /* | |
| 19 | * Created on 13.08.2005 | |
| 20 | * | |
| 21 | */ | |
| 22 | package net.sourceforge.combean.interfaces.graph.alg.flow; | |
| 23 | ||
| 24 | import net.sourceforge.combean.interfaces.graph.Node; | |
| 25 | ||
| 26 | /** | |
| 27 | * A maximum s-t flow algorithm. | |
| 28 | * | |
| 29 | * @author schickin | |
| 30 | * | |
| 31 | */ | |
| 32 | public interface MaxFlowAlg extends AbstractFlowAlg { | |
| 33 | ||
| 34 | /** | |
| 35 | * Set the source node of the flow. | |
| 36 | * | |
| 37 | * @param s the source node | |
| 38 | */ | |
| 39 | void setSource(Node s); | |
| 40 | ||
| 41 | /** | |
| 42 | * Set the target node of the flow. | |
| 43 | * | |
| 44 | * @param t the target node. | |
| 45 | */ | |
| 46 | void setTarget(Node t); | |
| 47 | ||
| 48 | /** | |
| 49 | * Get the value of the maximum flow. May only be called after the | |
| 50 | * algorithm has been run. | |
| 51 | * | |
| 52 | * @return the value of the maximum flow. | |
| 53 | */ | |
| 54 | public double getTotalFlow(); | |
| 55 | ||
| 56 | } |