Content deleted Content added
m Signing comment by 59.98.124.227 - "" |
Quuxplusone (talk | contribs) |
||
Line 55:
The Shortest-Path-Problem for graphs with non-negative-weights doesn't have a [[matroid]] or [[greedoid]] structure. Therefore this problem cannot be solved by an greedy-algorithm. Therefore Dijkstra is not greedy. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/131.220.109.37|131.220.109.37]] ([[User talk:131.220.109.37|talk]]) 09:29, 23 March 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
:Have you read the Wikipedia article on [[Dijkstra's algorithm]]? Both that article and this one make a pretty good case for calling Dijkstra's algorithm "greedy" (in comparison to algorithms like this one that are more "open-minded" and can't be "tricked" by promising paths that turn out to be dead ends). See also [http://www.google.com/search?q=dijkstra%27s.algorithm.greedy Google.] I don't know what "[[matroid]] or [[greedoid]] structure" has to do with this article; I guess you're talking about a very highly specialized use of the word "greedy" that this article isn't using. Anyway, it would make sense to take this up at [[Talk:Dijkstra's algorithm]], at least until that article stops referring to Dijkstra's algorithm as "greedy". :) --[[User:Quuxplusone|Quuxplusone]] ([[User talk:Quuxplusone|talk]]) 06:45, 24 March 2009 (UTC)
Bellmam ford algorithm can be used in the network having negative terms in the nodes.I <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/59.98.124.227|59.98.124.227]] ([[User talk:59.98.124.227|talk]]) 06:38, 24 March 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
| |||