 |
| ||||
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 | |||||||||
先判连通 void ，然后bellman－ford 判负权环unbound， 最后搜双关键字的最短路(如果不存在 void)？ 请问是这样么？In Reply To:题目有些不明白，是不是既要the minimal length 也是 the minimal weight， 如果已经满足 minimal length, 那么就一定不会出现 unbound 了， 是么？ Posted by:semonteer at 2005-10-27 12:21:47 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
