weixin_43791787的博客

原题目：DescriptionThe 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 t...

原文章：Given a connected undirected graph, tell if its minimum spanning tree is unique.Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgra...

原文链接：https://blog.youkuaiyun.com/JiangHxin/article/details/102223985kruskal算法思路：关于次小生成树，首先求出最小生成树，然后枚举每条不在最小生成树上的边（在原本的节点上添加一个vis属性进行判断即可），并把这条边放到最小生成树上面，然后就一定会形成环，那么我们在这条环路中取出一条（除了新加入的那一条边）最长的路（这里可以用...

原题目：Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.Farmer John ordered a hig...

原题目：There 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, if and onl...

原题目：The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes roads relentl...

原题目：You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pair...

原文链接：https://blog.youkuaiyun.com/JiangHxin/article/details/1011458931.Kruskal算法 （时间复杂度O （m log m))算法思想：1.建立一个并查集，每个点构成一个集合；2.将边进行从小到大进行排序，依次扫描边edge(u,v,w);3.如果u和v 属于同一个集合，那么跳过这轮循环；4.如果不属于同一个集合，则把u、v合...