Content deleted Content added
m Signing comment by 131.220.109.37 - "→Undefined Terms: " |
No edit summary |
||
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-->
Bellmam ford algorithm can be used in the network having negative terms in the nodes.I
| |||