Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register
北京大学暑期课《ACM/ICPC竞赛训练》面向全球招生!

Re:为什么是Prim最小树的最大边权就可以了?怎么证明这个最大值是最小的?

Posted by cyclone at 2010-07-31 17:21:19 on Problem 2485
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:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator