const int maxn = 101;
void Prim(int n, int dist[maxn], int map[maxn][maxn], int pre[maxn])
{
int i, j, k;
int min;
bool p[maxn];
for (i = 2; i <= n; i++)
{
p[i] = false;
dist[i] = map[1][i];
pre[i] = 1;
}
dist[1] = 0;
p[1] = true;
for (i = 1; i <= n; i++)
{
min = INT_MAX;
k = 0;
for (j = 1; j <= n; j++)
{
if (!p[j] && dist[j] < min)
{
min = dist[j];
k = j;
}
}
if (k == 0) return;
p[k] = true;
for (j = 1; j <= n; j++)
{
if (!p[j] && map[k][j] != INT_MAX && dist[j] > map[k][j])
{
dist[j] = map[k][j];
pre[j] = k;
}
}
}
}
Prime(模板)
最新推荐文章于 2019-07-11 16:58:22 发布