 |
| ||||
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 | |||||||||
Floyd算法空间复杂度是O(n*n*n)的, 您怎么算的?In Reply To:图的两两顶点之间的最短路问题，除了Floyd算法，又没有空间复杂度更低的？ Posted by:guoxi022 at 2006-11-17 10:28:27 > Floyd算法空间复杂度是O(n*n*n)的，想问问大家知不知道又没有空间复杂度更低的算法？ Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
