距离矢量路由算法（最短路Bellman-Ford实现）实现

using namespace std;

const int MAXN = 100 ;

const int MAXV = MAXN * MAXN;

const int INF = 2000000000 ;

struct EDGE

int g[MAXN][MAXN];

EDGE e[MAXV];

int BellmanFord( int beg, int end, int nNum, int eNum)

int main()

{

int i, j;

int t = 0 ;

int eNum = 0 ;

int nNum = 9 ;

for (i = 0 ; i < 4 ; i ++ )

for (j = 0 ; j < 4 ; j ++ )

{

if (i == j)

{

g[i][j] = INF;

}

else

{

g[i][j] = ++ t;

e[eNum].u = i;

e[eNum].v = j;

eNum ++ ;

}

}

cout << BellmanFord( 2 , 3 , nNum, eNum) << endl;

return 0 ;

}