【图论】
zthgreat
这个人很懒,什么都没有留下
展开
-
最小生成树kruskal算法(并查集)
kruskal算法原创 2014-10-15 00:22:37 · 1030 阅读 · 0 评论 -
zoj 1542 Network(最小生成树))
NetworkTime Limit: 2 Seconds Memory Limit: 65536 KB Special JudgeAndrew is working as system administrator and is planning to establish a new network in his company. There will be原创 2014-09-10 23:43:10 · 579 阅读 · 0 评论 -
hdu 1874 畅通工程续(最短路径)
Problem Description某省自从实行了很多年的畅通工程计划后,终于修建了很多路。不过路多了也不好,每次要从一个城镇到另一个城镇时,都有许多种道路方案可以选择,而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在,已知起点和终点,请你计算出要从起点到终点,最短需要行走多少距离。 Input本题目包含多组数据,请处理到文件结束。原创 2014-09-21 21:14:54 · 561 阅读 · 0 评论 -
hdu 3371 Connect the Cities(最小生成树))
Connect the CitiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10336 Accepted Submission(s): 2941Problem DescriptionIn 210原创 2014-09-01 00:13:12 · 463 阅读 · 0 评论 -
图的单源最短路径Bellman-Ford算法
Dijkstra算法是处理单源最短路径的有效算法,但它局限于边的权值非负的情况,若图中出现权值为负的边,Dijkstra算法就会失效,求出的最短路径就可能是错的。适用条件&范围:单源最短路径(从源点s到其它所有顶点v);有向图&无向图(无向图可以看作(u,v),(v,u)同属于边集E的有向图);边权可正可负(如有负权回路输出错误提示);原创 2014-10-26 17:06:22 · 1017 阅读 · 0 评论 -
zoj 1298 Domino Effect(最短路径)
Did you know that you can use domino bones for other things besides playing Dominoes? Take a number of dominoes and build a row by standing them on end with only a small distance in between. If you原创 2014-09-27 15:57:49 · 537 阅读 · 0 评论 -
poj 1985 Cow Marathon(树直径)
DescriptionAfter hearing about the epidemic of obesity in the USA, Farmer John wants his cows to get more exercise, so he has committed to create a bovine marathon for his cows to run. The maratho原创 2014-10-17 23:05:53 · 626 阅读 · 0 评论 -
TOJ 3517 The longest athletic track(树直径)
After a long time of algorithm training, we want to hold a running contest in our beautiful campus. Because all of us are curious about a coders's fierce athletic contest,so we would like a more lon原创 2014-10-05 17:08:41 · 739 阅读 · 0 评论 -
hdu 3405 World Islands(最小生成树)
Problem DescriptionDubai is a haven for the rich. The government of Dubai finds a good way to make money. They built a lot of artificial islands on the sea and sell them. These islands are shaped原创 2014-10-19 23:04:55 · 593 阅读 · 0 评论 -
hdu 2122 Ice_cream’s world III(最小生成树))
Problem Descriptionice_cream’s world becomes stronger and stronger; every road is built as undirected. The queen enjoys traveling around her world; the queen’s requirement is like II problem, beau原创 2014-09-21 21:49:19 · 501 阅读 · 0 评论 -
hdu 2544 最短路
Problem Description在每年的校赛里,所有进入决赛的同学都会获得一件很漂亮的t-shirt。但是每当我们的工作人员把上百件的衣服从商店运回到赛场的时候,却是非常累的!所以现在他们想要寻找最短的从商店到赛场的路线,你可以帮助他们吗? Input输入包括多组数据。每组数据第一行是两个整数N、M(N输入保证至少存在1条商店到赛场的路线。原创 2014-09-20 00:48:14 · 601 阅读 · 0 评论 -
poj 1847 Tram(最短路径)
DescriptionTram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switch pointing to the one of the rails going out of the原创 2014-12-08 19:52:25 · 598 阅读 · 0 评论 -
zoj 1586 QS Network(最小生成树))
In the planet w-503 of galaxy cgb, there is a kind of intelligent creature named QS. QScommunicate with each other via networks. If two QS want to get connected, they need to buy two network adapter原创 2014-09-12 11:48:18 · 631 阅读 · 0 评论 -
图论--拓扑排序及其应用
在⼯工程实践中,⼀一个⼯工程项⽬目往往由若⼲干个⼦子项⽬目组成。这些⼦子项⽬目间往往有两种关系:1先后关系,即必须在⼀一项 ⽬目完成拭⼀一,才能开始实施另⼀一个⼦子项⽬目;2⼦子项⽬目间⽆无关系,即两个⼦子项⽬目可以同时进⾏行,互不影响。⼯工⼚厂⾥里产品的⽣生 产线上,⼀一个产品由若⼲干个零部件组成。零部件⽣生产时,也存在这两种关系:先后关系,即⼀一个部件必须在完成后才能⽣生 产另⼀一个部件;部件原创 2014-11-06 10:29:57 · 9121 阅读 · 0 评论 -
Tarjan离线算法求最近公共祖先(LCA)
Problem DescriptionThere are n houses in the village and some bidirectional roads connecting them. Every day peole always like to ask like this "How far is it if I want to go from house A to house原创 2014-10-20 18:09:18 · 735 阅读 · 0 评论 -
zoj 1655 Transport Goods(最短路径)
The HERO country is attacked by other country. The intruder is attacking the capital so other cities must send supports to the capital. There are some roads between the cities and the goods must be原创 2014-09-28 00:10:20 · 865 阅读 · 0 评论 -
poj 1128 Frame Stacking(拓扑排序)
DescriptionConsider the following 5 picture frames placed on an 9 x 8 array. ........ ........ ........ ........ .CCC....EEEEEE.. ........ ........ ..BBBB.. .C.C....E....E.. DDDDDD.. .......原创 2014-11-07 18:01:20 · 580 阅读 · 0 评论 -
hdu 3790 最短路径问题
Problem Description给你n个点,m条无向边,每条边都有长度d和花费p,给你起点s终点t,要求输出起点到终点的最短距离及其花费,如果最短距离有多条路线,则输出花费最少的。 Input输入n,m,点的编号是1~n,然后是m行,每行4个数 a,b,d,p,表示a和b之间有一条边,且其长度为d,花费为p。最后一行是两个数 s,t;起点s,终点。n和m为原创 2015-03-15 21:11:01 · 500 阅读 · 0 评论 -
poj 2421 Constructing Roads(最小生成树))
DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say two village A and B are connected, i原创 2014-09-12 11:24:52 · 496 阅读 · 0 评论 -
zoj 2750 Idiomatic Phrases Game(最短路径)
Tom is playing a game called Idiomatic Phrases Game. An idiom consists of several Chinese characters and has a certain meaning. This game will give Tom two idioms. He should build a list of idioms a原创 2014-09-27 20:27:25 · 426 阅读 · 0 评论 -
hdu4738 Caocao's Bridges(双连通分量割边/桥)
Problem DescriptionCaocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn't give up. Caocao's army still was not good at water battles, so he came up with another ide原创 2015-05-21 22:16:02 · 615 阅读 · 0 评论 -
wikioi 1231 最优布线问题
题目描述 Description学校需要将n台计算机连接起来,不同的2台计算机之间的连接费用可能是不同的。为了节省费用,我们考虑采用间接数据传输结束,就是一台计算机可以间接地通过其他计算机实现和另外一台计算机连接。为了使得任意两台计算机之间都是连通的(不管是直接还是间接的),需要在若干台计算机之间用网线直接连接,现在想使得总的连接费用最省,让你编程计算这个最小的费用。原创 2014-10-04 20:16:15 · 1299 阅读 · 0 评论 -
最小生成树prim算法(贪心)
一个连通图的生成树是一个极小的连通子图,它含有图中全部的顶点,但只有足以构成一棵树的n-1条边。所谓的最小成本,就是n个顶点,用n-1条边把一个连通图连接起来,并且使得权值的和最小。综合以上两个概念,我们可以得出:构造连通网的最小代价生成树,即最小生成树(Minimum Cost Spanning Tree)。Prim算法也是利用贪心算法来解决最小生成树。最小生成树MST性原创 2014-10-09 19:27:49 · 1558 阅读 · 1 评论 -
pop 1270 Following Orders(拓扑排序)
DescriptionOrder is an important concept in mathematics and in computer science. For example, Zorn's Lemma states: ``a partially ordered set in which every chain has an upper bound contains a maxi原创 2014-11-16 12:55:25 · 509 阅读 · 0 评论 -
hdu 1596 find the safest road(最短路径)
Problem DescriptionXX星球有很多城市,每个城市之间有一条或多条飞行通道,但是并不是所有的路都是很安全的,每一条路有一个安全系数s,s是在 0 和 1 间的实数(包括0,1),一条从u 到 v 的通道P 的安全度为Safe(P) = s(e1)*s(e2)…*s(ek) e1,e2,ek是P 上的边 ,现在8600 想出去旅游,面对这这么多的路,他想找一条最安全的路。但是原创 2014-09-19 00:13:57 · 479 阅读 · 0 评论 -
hdu 2874 Connections between cities(最近公共祖先(LCA))
Problem DescriptionAfter World War X, a lot of cities have been seriously damaged, and we need to rebuild those cities. However, some materials needed can only be produced in certain places. So we原创 2014-10-22 22:38:56 · 662 阅读 · 0 评论 -
zoj 2158 Truck History(最小生成树))
Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing each type of a原创 2014-09-12 15:20:20 · 495 阅读 · 0 评论 -
poj 1258 Agri-Net(最小生成树))
Agri-NetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 40459 Accepted: 16496DescriptionFarmer John has been elected mayor of his town! One of his cam原创 2014-08-31 20:06:16 · 543 阅读 · 0 评论 -
hdu 5154 Harry and Magical Computer(拓扑排序,dfs判环)
Problem DescriptionIn reward of being yearly outstanding magic student, Harry gets a magical computer. When the computer begins to deal with a process, it will work until the ending of the processes原创 2015-01-03 22:13:17 · 593 阅读 · 0 评论 -
图的单源最短路径SPFA算法
算法大致流程是用一个队列来进行维护。初始时将源加入队列。每次从队列中取出一个元素,并对所有与他相邻的点进行松弛,若某个相邻的点松弛成功,则将其入队。直到队列为空时算法结束。这个算法,简单的说就是队列优化的bellman-ford,利用了每个点不会更新次数太多的特点发明的此算法SPFA——Shortest Path Faster Algorithm,它可以在O(kE)的时间复杂度内求原创 2014-10-27 00:30:54 · 665 阅读 · 0 评论 -
hdu 4771 Stealing Harry Potter's Precious(最短路径)
Problem Description Harry Potter has some precious. For example, his invisible robe, his wand and his owl. When Hogwarts school is in holiday, Harry Potter has to go back to uncle Vernon's home.原创 2014-11-12 15:09:13 · 597 阅读 · 0 评论 -
hdu 4607 Park Visit(树直径)
Problem DescriptionClaire and her little friend, ykwd, are travelling in Shevchenko's Park! The park is beautiful - but large, indeed. N feature spots in the park are connected by exactly (N-1) un原创 2014-10-18 00:27:36 · 577 阅读 · 0 评论 -
poj 1330 Nearest Common Ancestors(最近公共祖先(LCA))
DescriptionA rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the figure, each node is labeled with an integer from {1, 2,...,16原创 2014-10-21 19:40:39 · 1484 阅读 · 0 评论 -
hdu 2122 Ice_cream’s world III(最小生成树)
Problem Descriptionice_cream’s world becomes stronger and stronger; every road is built as undirected. The queen enjoys traveling around her world; the queen’s requirement is like II problem, beauti原创 2014-10-18 20:02:45 · 567 阅读 · 0 评论 -
zoj 2048 Highways(最小生成树))
HighwaysTime Limit: 5 Seconds Memory Limit: 32768 KB Special JudgeThe island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways.原创 2014-09-17 00:27:00 · 753 阅读 · 0 评论 -
zoj 1914 Arctic Network(最小生成树))
The Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the network: every原创 2014-09-12 16:40:36 · 761 阅读 · 0 评论 -
zoj 1406 Jungle Roads(最小生成树))
Jungle RoadsTime Limit: 2 Seconds Memory Limit: 65536 KBThe Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads betwe原创 2014-09-11 22:38:47 · 510 阅读 · 0 评论 -
zoj 1203 Swordfish(最小生成树))
SwordfishTime Limit: 2 Seconds Memory Limit: 65536 KBThere exists a world within our worldA world beneath what we call cyberspace.A world protected by firewalls,passwords and the mo原创 2014-09-10 23:13:38 · 569 阅读 · 0 评论 -
hdu 1285 确定比赛名次(拓扑排序)
Problem Description有N个比赛队(1 Input输入有若干组,每组中的第一行为二个数N(1 Output给出一个符合要求的排名。输出时队伍号之间有空格,最后一名后面没有空格。其他说明:符合条件的排名可能不是唯一的,此时要求输出时编号小的队伍在前;输入数据保证是正确的,即输入数据确保一定能有一个符合要求原创 2014-09-16 20:44:14 · 461 阅读 · 0 评论