| ||||||||||
| 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 | |||||||||
Dijkstra复杂度到底是多少各位大牛们,大家说说Dijkstra复杂度到底是多少啊,我baidu了下 发现答案不一,如果图用邻接链表表示,优先队列用最小堆来实现,该算法属于O(|E|log|v|) ,而另一种就是dijkstra算法的时间复杂度是O(VlgV+E),这里V,E分别是顶点和边的数目 。我都搞糊涂了。。谁来解释下。。。谢谢 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator