最小费用流及matlab程序
4星 · 超过85%的资源 需积分: 14 67 浏览量
2011-06-14
20:05:31
上传
评论 1
收藏 33KB DOC 举报 
1、有关网络流的一个算法：求一个网络中的最大流。
#include<iostream.h>
#deneFALSE0
#deneTRUE1
#deneN6
#deneMAXSTREAM999
intGraphMatrix[N][N]={{0,1,1,0,0,0},
{0,0,1,1,1,0},
{0,0,0,1,1,0},
{0,0,0,0,1,1},
{0,0,0,0,0,1},
{0,0,0,0,0,0}};
intcStreamMatrix[N][N]={{0,3,7,0,0,0},
{3,0,2,5,4,0},
{7,2,0,1,4,0},
{0,5,1,0,2,8},
{0,4,4,2,0,3},
{0,0,0,8,3,0}};
intfStreamMatrix[N][N]={{0,0,0,0,0,0},
{0,0,0,0,0,0},
{0,0,0,0,0,0},
{0,0,0,0,0,0},
{0,0,0,0,0,0},
{0,0,0,0,0,0}};
structNetNodeType
{intFlag;
intcStream;
intfStream;
}NetMatrix[N+1][N+1];
structNodeType
{intLabel;
intStream;
}Node[N+1];
voidInitialize(void)
{inti,j;
资源评论
wycbx83842012-12-27最小费用在matlab里有自带的函数linprog
leader5682012-08-14不咋好用啊，调试很久都没通过
