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

Dijkstra复杂度到底是多少

Posted by 5438 at 2009-02-06 19:29:08
各位大牛们,大家说说Dijkstra复杂度到底是多少啊,我baidu了下
发现答案不一,如果图用邻接链表表示,优先队列用最小堆来实现,该算法属于O(|E|log|v|)
,而另一种就是dijkstra算法的时间复杂度是O(VlgV+E),这里V,E分别是顶点和边的数目 。我都搞糊涂了。。谁来解释下。。。谢谢

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