Module org.maxicp

Package org.maxicp.cp.engine.constraints

Class MinCostMaxFlow

java.lang.Object

org.maxicp.cp.engine.constraints.MinCostMaxFlow

public class MinCostMaxFlow
extends Object

Minimum-cost maximum-flow algorithm using successive shortest augmenting paths with potentials.

Constructor Summary

Constructors

Constructor	Description
MinCostMaxFlow(int H, int numNodes)	Creates a minimum-cost maximum-flow solver for a network with a given number of nodes.

Method Summary

Modifier and Type	Method	Description
int[][]	getFlow()
int	getTotalCost()
int	getTotalFlow()
boolean	run(int source, int dest, int[][] capMaxNetworkFlow, int[][] costNetworkFlow)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

MinCostMaxFlow

public MinCostMaxFlow(int H,
 int numNodes)

Creates a minimum-cost maximum-flow solver for a network with a given number of nodes.

Parameters:

H - the maximum cost bound

numNodes - the total number of nodes in the flow network

Method Details

run

public boolean run(int source,
 int dest,
 int[][] capMaxNetworkFlow,
 int[][] costNetworkFlow)

getTotalCost

public int getTotalCost()

getTotalFlow

public int getTotalFlow()

getFlow

public int[][] getFlow()