该博客介绍了一个求解图的最小差值生成树问题，给出了一种通过排序边的权重并进行枚举的方法来找到最瘦的生成树，使得树中最大权重边和最小权重边的差值最小。博客提供了输入输出示例，并讨论了算法思路。
Slim Span
Description
Given an undirected weighted graph G, you should find one of spanning trees specified as follows.
The graph G is an ordered pair (V, E), where V is a set of vertices { v1, v2, …, vn} and E is a set of undirected edges { e1, e2, …, em}. Each edge e ∈ E has its weight w(e).
A spanning tree T is a tree (a connected subgraph without cycles) which connects all the n vertices with n − 1 edges. The slimness of a spanning tree T is defined as the difference between the largest weight and the smallest weight among the n − 1 edges of T.
Figure 5: A graph G and the weights of the edges
For example, a graph G in Figure 5(a) has four vertices { v1, v
最低0.47元/天 解锁文章
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
