Detail of message

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算法，又没有空间复杂度更低的？

Posted by guoxi022 at 2006-11-17 10:28:27

Floyd算法空间复杂度是O(n*n*n)的，想问问大家知不知道又没有空间复杂度更低的算法？

Followed by:

Floyd算法空间复杂度是O(n*n*n)的, 您怎么算的? (50) sunmoonstar 2006-11-17 10:41:44
- Re:Floyd算法空间复杂度是O(n*n*n)的, 您怎么算的? (72) guoxi022 2006-11-17 10:45:45
  - 时间复杂度是n^3, 空间复杂度是n^2, 书上有 (76) sunmoonstar 2006-11-17 10:48:47
    - Re:时间复杂度是n^3, 空间复杂度是n^2, 书上有 (33) guoxi022 2006-11-17 10:54:15
      - Re:时间复杂度是n^3, 空间复杂度是n^2, 书上有 (90) Yuzia 2006-11-17 11:20:33

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator