图论
关注
分享
扫一扫
文章平均质量分 69
coco_astrids
"Remembering that you are going to die is the best way I know to avoid the trap of thinking you have something to lose. You are already naked. There is no reason not to follow your heart."
------Jobs
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
Codeforces 330B(图论---寻找能连接其他所有点的点)
B. Road Construction time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A country has n cities. Initially, the原创 2016-09-20 07:54:36 · 554 阅读 · 0 评论 -
QUT个人赛--寻找最近公共祖先(图的遍历<POJ1330>)
Description A 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原创 2016-09-17 16:01:24 · 377 阅读 · 0 评论 -
最小生成树---Prim---Kruskal
最小生成树之prim算法 最小生成树（MST）：权值最小的生成树。 MST性质：假设G＝(V,E)是一个连通网，U是顶点V的一个非空子集。若(u,v)是一条具有最小权值的边，其中u∈U，v∈V－U，则必存在一棵包含边(u,v)的最小生成树。 prim算法 基本思想：假设G＝(V，E)是连通的，TE是G上最小生成树中边的集合。算法从U＝{u0}（u0∈V）、TE＝{}开始。重复原创 2016-10-24 18:22:50 · 324 阅读 · 0 评论 -
poj---1751 Highways
Highways Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 12946 Accepted: 3738 Special Judge Description The island nation of Flatopia is perfectly flat原创 2016-10-24 23:15:05 · 262 阅读 · 0 评论 -
HDU 1548 最短路---A strange life
Problem Description There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.The lift have just two buttons: up and down.When yo原创 2016-11-13 17:11:10 · 269 阅读 · 0 评论