poj 1258 有向图变无向图 求最小生成树
来源:互联网 发布:linux谁的视频好 编辑:程序博客网 时间:2024/05/22 09:05
http://vjudge.net/contest/view.action?cid=48211#problem/D
Description
Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.
Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm to all the other farms.
Given a list of how much fiber it takes to connect each pair of farms, you must find the minimum amount of fiber needed to connect them all together. Each farm must connect to some other farm such that a packet can flow from any one farm to any other farm.
The distance between any two farms will not exceed 100,000.
Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm to all the other farms.
Given a list of how much fiber it takes to connect each pair of farms, you must find the minimum amount of fiber needed to connect them all together. Each farm must connect to some other farm such that a packet can flow from any one farm to any other farm.
The distance between any two farms will not exceed 100,000.
Input
The input includes several cases. For each case, the first line contains the number of farms, N (3 <= N <= 100). The following lines contain the N x N conectivity matrix, where each element shows the distance from on farm to another. Logically, they are N lines of N space-separated integers. Physically, they are limited in length to 80 characters, so some lines continue onto others. Of course, the diagonal will be 0, since the distance from farm i to itself is not interesting for this problem.
Output
For each case, output a single integer length that is the sum of the minimum length of fiber required to connect the entire set of farms.
Sample Input
40 4 9 214 0 8 179 8 0 1621 17 16 0
Sample Output
28
解题思路:我们可以把它当做无向图来做,利用kruskal算法
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>using namespace std;struct note{ int start; int end; int w;} edge[10025];int pa[10005];int n,m,k,p;bool cmp(note a,note b){ if(a.w<b.w) return true; return false;}void make_set(){ for(int x=0; x<=p; x++) { pa[x]=x; }}int find(int x){ if(x!=pa[x]) return pa[x]=find(pa[x]); return pa[x];}int kruskal(){ int i,ans=0; //printf("**\n"); make_set(); sort(edge,edge+p,cmp); for(i=0; i<p; i++) { int x=find(edge[i].start); int y=find(edge[i].end); //printf("%d,%d,\n",x,y); if(x!=y) { pa[y]=x; ans+=edge[i].w; } } return ans;}int main(){ int n,x; while(~scanf("%d",&n)) { p=0; for(int i=1; i<=n; i++) for(int j=1; j<=n; j++) { scanf("%d",&x); if(i<j) { edge[p].start=i; edge[p].end=j; edge[p].w=x; //printf("(%d)\n",edge[p].w); p++; } } printf("%d\n",kruskal()); } return 0;}
0 0
- poj 1258 有向图变无向图 求最小生成树
- POJ 3164 有向图的最小生成树
- 有向图的最小生成树
- 有向图最小生成树
- 最小树形图--有向图的最小生成树 poj 3164 Command Network
- 有向图的最小生成树,最小树形图
- HDU4009 最小树形图 有向最小生成树
- POJ 2485 Highways 无向图最小生成树求最长的边
- prime算法求无向图的最小生成树
- Prim求无向连通图最小生成树
- 【UVA11183】【裸朱刘算法】【有向图的最小生成树】
- 【hdu4009】【建模】【有向图的最小生成树】
- uva 11183 有向图最小生成树
- POJ-3164 Command Network(最小树形图(有向图的最小生成树)[朱刘算法])
- 有向图无向图领接表深度优先广度优先最小生成树
- poj 2125 有向图破坏,求拆掉图中所有边的最小代价
- hihocoder 1378(有向图求最小割集)
- HDU 5483 (最小生成树 + 求无向图割边)
- EAS系统自定义公式及参数配置表。
- 二叉排序树
- [GEM5学习]2、GEM5模块继承关系和运行机制解析
- 算法导论第13(十三)章红黑树
- Android WIFI功能开发<2>对WIfi的操作
- poj 1258 有向图变无向图 求最小生成树
- javascript基础知识点(with)2
- extjs关于tree的远程加载
- Trie树
- Struts2 中There is no Action mapped for action name helloword
- web前端开发之Web移动开发/WebApp开发技术
- Java线程:创建与启动
- C#程序架构
- 抠卤技睦磊梅柯嗽颖记撩廖