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 benny391 at 2009-06-03 09:31:10 on Problem 2485
In Reply To:为什么是Prim最小树的最大边权就可以了?怎么证明这个最大值是最小的? Posted by:z__jj at 2009-03-12 23:42:54
假设最小生成树的最长边为(x,y)
在MST中去掉(x,y)之后,与x相连的为集合m,与y相连的为n
如果存在一条边(a,b) 其中a属于m,b属于n,其权w(a,b)<w(x,y),
与假设不符,所以MST的最长边最短。

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