 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
Re:为什么是Prim最小树的最大边权就可以了？怎么证明这个最大值是最小的？In Reply To:为什么是Prim最小树的最大边权就可以了？怎么证明这个最大值是最小的？ Posted by:z__jj at 2009-03-12 23:42:54 假设最小生成树T0的最大权边是em = (a1,a2)，因为T0跟生成顺序无关，不妨设a1是最后选择的，所以w(em) <= w(a1,ai)；而对于其他的生成树T，为了连接a1必须包含某个e = (a1,ai)，所以其最长边不小于w(em) Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
