Andrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since each worker of the company must have access to the whole network, each hub must be accessible by cables from any other hub (with possibly some intermediate hubs).
Since cables of different types are available and shorter ones are cheaper, it is necessary to make such a plan of hub connection, that the maximum length of a single cable is minimal. There is another problem - not each hub can be connected to any other one because of compatibility problems and building geometry limitations. Of
该博客讲述了如何解决一个网络连接问题，目标是找到一个网络连接方案，使得所有节点间都能通过连接路径到达，同时单条电缆的最大长度最小。问题转化为寻找最小生成树，给出输入输出样例，并强调最大边应为所有生成树中最小的。解决方案是构建最小生成树。
最低0.47元/天 解锁文章
2586
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
