Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
 Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

时间复杂度是n^3, 空间复杂度是n^2, 书上有

Posted by sunmoonstar at 2006-11-17 10:48:47
In Reply To:Re:Floyd算法空间复杂度是O(n*n*n)的, 您怎么算的? Posted by:guoxi022 at 2006-11-17 10:45:45 
> Floyd算法需要用到一个存储中间结点的矩阵，这个矩阵是三维的，如果有n个node，那么Floyd算法最多要占用n*n*n的空间，不知道对不对？
Followed by:
Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top

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