POJ1287 Networking
来源:互联网 发布:阿里云分布式文件系统 编辑:程序博客网 时间:2024/04/30 18:46
Prim
//============================================================================
// Name : hello.cpp// Author : key
// Version : 8
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define NUM_INF 0x7FFFFFFF
int vis[70];
int lowc[70];
int cost[70][70];
int prim(int n) // vertex: 0 ~ n-1
{
int i, j, p;
int minc, res = 0;
memset(vis, 0, sizeof(vis));
vis[0] = 1;
for (i=1; i<n; i++)
lowc[i] = cost[0][i];
for (i=1; i<n; i++)
{
minc = NUM_INF; p = -1;
for (j=0; j<n; j++)
{
if (0 == vis[j] && minc > lowc[j])
{
minc = lowc[j]; p = j;
}
}
if (NUM_INF == minc)
return -1; // 原图不连通
res += minc; vis[p] = 1;
for (j=0; j<n; j++)
{
if (0 == vis[j] && lowc[j] > cost[p][j])
{
lowc[j] = cost[p][j];
}
}
}
return res;
}
int main()
{
int n;
int t;
int a,b,c;
int i,j;
while(scanf("%d",&n)!=EOF&&n)
{
for(i=0;i<n;i++)
for(j=0;j<n;j++)
cost[i][j] = NUM_INF;
scanf("%d",&t);
while(t--)
{
scanf("%d%d%d",&a,&b,&c);
a--;
b--;
if(cost[a][b]>c)
{
cost[a][b] = c;
cost[b][a] = c;
}
}
printf("%d\n",prim(n));
}
return 0;
}
- POJ1287 Networking
- poj1287 Networking
- POJ1287 Networking
- poj1287 - Networking
- POJ1287-Networking
- poj1287 Networking
- POJ1287 Networking
- Networking||POJ1287
- POJ1287 Networking(最小生成树)
- poj1287 Networking【最小生成树】
- poj1287 Networking 最小生成树,kruskal
- POJ1287 && ZOJ 1372--Networking【水题 && kruskal】
- poj1287——Networking(prim)
- POJ1287 Networking(最小生成树,Kruskal,Prim)
- 【POJ1287】Networking(最小生成树)
- POJ1287——————networking
- poj1287
- poj1287
- 关闭Aphache和重启Apache
- 嵌入式C笔试总结(长期更新)
- 优化资源
- POJ 1018 Communication System
- POJ 1220 NUMBER BASE CONVERSION
- POJ1287 Networking
- POJ 1466 Girls and Boys
- POJ 1496 1850
- gt_opencv_helloworld_img_实现详解(一)
- 关于开通博客的声明
- POJ 1589 Unix ls
- POJ 2075 Tangled in Cables
- 存贮容量计算单位
- OI比赛注意