net.sourceforge.combean.interfaces.graph.alg.flow
Interface FeasibleFlowAlg

All Superinterfaces:

AbstractFlowAlg, GraphAlgorithm

All Known Subinterfaces:

MinCostFlowAlg, MulticommodityMinCostFlowAlg

All Known Implementing Classes:

MinCostFlowByLPAlg, MulticommodityMinCostFlowByLPAlg

public interface FeasibleFlowAlg
extends AbstractFlowAlg

A flow algorithm for finding a feasible flow with given flow balance for each node (if one exists).

Method Summary

boolean	isFeasible() Check if a feasible flow exists.
void	setInflowMap(FixedDoubleNodeMap inflowMap) Set the inflow at each node in the graph.

Methods inherited from interface net.sourceforge.combean.interfaces.graph.alg.flow.AbstractFlowAlg

getFlowMap, setEdgeCapacityMap

Methods inherited from interface net.sourceforge.combean.interfaces.graph.alg.GraphAlgorithm

getGraph, run, setGraph

Method Detail

setInflowMap

void setInflowMap(FixedDoubleNodeMap inflowMap)

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.

Parameters:

inflowMap - the inflow at each node.

isFeasible

boolean isFeasible()

Check if a feasible flow exists. May only be called after the algorithm has been executed.

Returns:

true if a feasible flow exists.