Sicily Single-link Clustering| Prim算法

最新推荐文章于 2022-06-09 14:57:18 发布

linzch3

最新推荐文章于 2022-06-09 14:57:18 发布

阅读量1k

点赞数

分类专栏： Oj 文章标签： sicily clustering prim 算法

本文链接：https://blog.csdn.net/linzch3/article/details/61421256

版权

本文介绍了如何使用Prim算法解决Sicily单链聚类问题，即找到二维空间中n个节点的最小生成树并删除第k-1条最长边。给出的解法包括算法原理、输入输出格式以及代码实现。

摘要由CSDN通过智能技术生成

Single-link Clustering
Total: 229 Accepted: 90

Time Limit: 1sec Memory Limit:256MB
Description
Given n nodes in a two-dimensional space, we want to use single-link custering method to find k clusters. This is equivalent to finding an MST (Minimum spanning tree) of these nodes and deleting k-1 longest edges.

Your job is to output the length of the (k-1)-th longest edges of the MST.

Input
There are multiple cases. For each case, the first line includes n and k (2<=k<=n<=100). The following n lines give the coordinates of n nodes. You may use Euclidean distance to measure the distance between two nodes.

Output
For each case, output the length of the (k-1)-th longest edges. The precision is set to 2 digits after the decimal point.

Sample Input
Copy sample input to clipboard
6 2
1 1
2 1
1 2
3 3
4 2
4 3
Sample Output
2.24