文件名称:zuixiaochengbenliu
介绍说明－－下载内容均来自于网络，请自行研究使用
程序由C语言完成，用Visual Studio 2012编译即可运行。
首先图的格式应为邻接矩阵，程序会提示输入n的大小，然后依次输入节点i，j，以及该节点的容量和成本。容量运费为0可以不用填写。以此类推，直到输入的节点为-1，-1则停止输入。
程序输出最小成本流邻接矩阵和最小成本。-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.
首先图的格式应为邻接矩阵，程序会提示输入n的大小，然后依次输入节点i，j，以及该节点的容量和成本。容量运费为0可以不用填写。以此类推，直到输入的节点为-1，-1则停止输入。
程序输出最小成本流邻接矩阵和最小成本。-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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
最小成本流算法.c