Dijkstra算法

#include <iostream>
#include <string.h>
using namespace std;

const int maxnum = 105;
const int maxint = 999999;

int dist[maxnum];     // 表示当前点到源点的最短路径长度
int cost[maxnum][maxnum];   // 记录图的两点间路径长度
bool vistied[maxnum];

void Dijkstra(int n, int v0)
{
memset(vistied, 0, sizeof(vistied));
for (int i = 1; i <= n; i++)
{
dist[i] = cost[v0][i];
}

vistied[v0] = true;
dist[v0] = 0;
//循环n-1次
for (int i = 2; i <= n; i++)
{
int min = maxint;
int u;
for (int j = 1; j <= n; j++)
{
if (!vistied[j] && min>dist[j])
{
min = dist[j];
u = j;

}
}
vistied[u] = true;
//更新dist
for (int j = 1; j <= n; j++)
{
if (!vistied[j] && min + cost[u][j] < dist[j])
{
dist[j] = min + cost[u][j];
}
}
}
}

int main()
{
//freopen("sample_input.txt", "r", stdin);
// 各数组都从下标1开始

int n, line;             // 图的结点数和路径数
int p, q, len;          // 输入p, q两点及其路径长度

while (1)
{

cin >> n >> line;
// 初始化c[][]为maxint
if (n == 0 && line == 0)
{
break;
}
memset(cost, maxint,sizeof(cost));
for (int i = 1; i <= line; ++i)
{
cin >> p >> q >> len;
if (len < cost[p][q])       // 有重边
{
cost[p][q] = len;      // p指向q
cost[q][p] = len;      // q指向p，这样表示无向图
}
}
Dijkstra(n, 1);
cout <<dist
<< endl;
}

}