算法导论习题解-第23章最小生成树

参考资料

23.1节的答案见 http://blog.csdn.net/anye3000/article/details/12091125

23.2节的答案见 https://sites.google.com/site/clrssolutions/home/chapter23

#23.1-1

设(u,v)是连通图G中权重最小的边，证明(u,v)是某棵最小生成树的边。

解：将顶点集V割为{u}和{V-u}

#23.1-2 反例

Professor Sabatier conjectures the following converse of Theorem 23.1. Let G = (V, E) be a connected, undirected graph with a real-valued weight function w defined on E. Let A be a subset of E that is included in some minimum spanning tree for G, let (S, V - S) be any cut of G that respects A, and let (u, v) be a safe edge for A crossing (S, V - S). Then, (u, v) is a light edge for the cut. Show that the professor's conjecture is incorrect by giving a count