图论
unhurried_swordsman
这个作者很懒,什么都没留下…
展开
-
HDU 1102 Constructing Roads(最小生成树 Kruskal算法)
输入一个邻接矩阵来表示无向图,再输入一些路径表示已连通,你要再加入一些最短的路径路径使得该图为连通图,输出这些路径的长度和。转载 2017-07-29 17:17:08 · 327 阅读 · 0 评论 -
POJ 1094 Sorting It All Out(拓扑排序 入度性质)
原题 Sorting It All Out Time Limit: 1000MS Memory Limit: 10000K Description An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order t转载 2017-08-07 20:23:31 · 327 阅读 · 0 评论 -
UVa 10305 Ordering Tasks(拓扑排序)
原题 Ordering Tasks John has n tasks to do. Unfortunately, the tasks are not independent and the execution of one task is only possible if other tasks have already been executed. Input The input wi转载 2017-07-26 16:04:44 · 437 阅读 · 0 评论