JOIN
Get Time
forums   
Search | Watch Thread  |  My Post History  |  My Watches  |  User Settings
View: Flat (newest first)  | Threaded  | Tree
Previous Thread  |  Next Thread
Runtime of shortest path algorithm | Reply
This article states the runtime of the shortest path algorithm is O(E*V*Log(V)). It must be a typo. It should be O(E + V*Log(V)).
Re: Runtime of shortest path algorithm (response to post by jyhuang) | Reply
Just saw this too... hope it gets fixed... Obviously makes it seem like it runs a lot slower than it should :D
Re: Runtime of shortest path algorithm (response to post by jyhuang) | Reply
Using Fibonacci Heap , it should be O(V log V + E).
Checked in CLRS.
RSS