JOIN
Get Time
forums  Revision History
Search My Post History  |  My Watches  |  User Settings
Forums Tutorial Discussions Dynamic Programming: From novice to advanced Re: Dynamic Programming: From novice to advanced Revision History (1 edit)
Re: Dynamic Programming: From novice to advanced (response to post by Auston)
Dijkstra's algorithm works for undirected graphs as well (you can reduce it to the undirected case by just using the same edge cost in both directions). In fact, that's how it was originally stated, as you can see by the n*(n-1)/2 upper bound on the number of edges mentioned at the end of the first page.
Re: Dynamic Programming: From novice to advanced (response to post by Auston)
Dijkstra's algorithm works for undirected graphs. In fact, that's how it was originally stated, as you can see by the n*(n-1)/2 upper bound on the number of edges mentioned at the end of the first page.