u012938194的专栏

设G = (V,E)是无向连通带权图，即一个网络。E中的每一条边（v,w）的权为c[v][w]。如果G的子图G’是一棵包含G的所有顶点的树，则称G’为G的生成树。生成树上各边权的总和称为生成树的耗费。在G的所有生成树中，耗费最小的生成树称为G的最小生成树。构造最小生成树的两种方法：Prim算法和Kruskal算法。 　一、最小生成树的性质 　　设G = (V,E)是连通带权图，U是V的

还是畅通工程 Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 26120    Accepted Submission(s): 11641 Problem Description 某省调查乡村交通状况，得到的统

畅通工程 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 17334    Accepted Submission(s): 7300 Problem Description 省政府“畅通工程”的目标是使全省任何

畅通工程再续 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 15329    Accepted Submission(s): 4745 Problem Description 相信大家都听说一个“百岛湖”的地

继续畅通工程 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 13981    Accepted Submission(s): 6080 Problem Description 省政府“畅通工程”的目标是使全省

Binary Tree Traversals Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3320    Accepted Submission(s): 1491 Problem Description A bin

Tree Recovery Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 11421   Accepted: 7167 Description Little Valentine liked playing with binary trees very much. He

Entropy Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 4919   Accepted: 1923 Description An entropy encoder is a data encoding method that achieves lossless d

Fence Repair Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 26361   Accepted: 8550 Description Farmer John wants to repair a small length of the fence aroun