Description: Procedures done by the C language, using Visual Studio 2012 compiler to run. First graph format should be the adjacency matrix, the program prompts for the size of n, followed by the input node i, j, and the capacity and cost of the node. Freight capacity is 0 can not fill. And so on, until the input node is-1,-1 stop input. The minimum cost flow program output adjacency matrix and minimum cost.
To Search:
File list (Check if you may need any files):
最小成本流算法.c
Download