Revision as of 06:38, 24 March 2009 edit 59.98.124.227 (talk) No edit summary ← Previous edit		Revision as of 06:39, 24 March 2009 edit undo SineBot (talk \| contribs) Bots 2,564,856 edits m Signing comment by 59.98.124.227 - "" Next edit →
Line 56: 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--> 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-->

Talk:Bellman–Ford algorithm: Difference between revisions