 |
| ||||
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:是Dijkstra 算法，大家别被误导了。！！！！！In Reply To:是Dijkstra 算法，大家别被误导了。！！！！！ Posted by:zhb_msqx at 2007-09-22 14:44:16 有人用Kruscal过了，我刚刚用prim也过了，看来此题解法多多... 从节点1开始用prim扩展最大生成树，记录父亲节点，然后找出节点n到1的路径中权值最小的边 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
