 |
| ||||
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 | |||||||||
不是的啊In Reply To:Re:我用的Kruskal,只要求一下次小生成树就行了 Posted by:uni at 2005-05-10 17:48:48 先求最小生成树 然后分别去掉最小生成树中的每一条边，求最小生成树 这些生成树中权和最小的就是次小生成树，如果他的权和和最小生成树相同，就是 !Unique Else Unique Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
