Content deleted Content added
m Signing comment by 68.43.177.99 - "→Dijkstra is not greedy: " |
|||
Line 60:
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-->
The [[greedoid]] page that you linked to explicitly lists Dijkstra's algorithm as an example. So, uh, yeah. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/68.43.177.99|68.43.177.99]] ([[User talk:68.43.177.99|talk]]) 16:31, 7 May 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
== Implementation removed ==
| |||