建立一张图,用最短路径算法求出从指定结点的最短路径结点序列

如下，图采用邻接矩阵存储，输入时要注意：n为顶点数；
e为边数。然后要输入e条边，及每一条的权值；输入合法
就会给出正确结果。已经在Dev C++中调试通过了。

#include <iostream>

using namespace std;

#include <iomanip>

#include <assert.h>

const int MAXVALUE = 2147483647;
const int MAXVNUM = 100;
const int SOURCE = 1;

void ADJMATRIX( int A[][MAXVNUM], int n, int e )
{
int i;
int j;
int k;
int weight;

for ( i = 1; i <= n; i++ )
{
for ( j = 1; j <= n; j++ )
{
A[i][j] = MAXVALUE;
}
} // Initializatioin

for ( k = 0; k < e; k++ )
{
cin >> i >> j >> weight;
A[i][j] = weight;
A[j][i] = weight;
}
return;
}

void output( int A[][MAXVNUM], int n )
{
int i;
int j;
cout << &qu