Talk:Bellman–Ford algorithm: Difference between revisions

Content deleted Content added
SineBot (talk | contribs)
m Signing comment by 66.119.173.210 - "Undefined Terms: "
Line 51:
This article uses the terms "relax" and "relaxation" in a specific technical sense, but gives no definition. The use of undefined terms in mathematical writing is considered poor form. -- [[Special:Contributions/172.191.112.126|172.191.112.126]] ([[User talk:172.191.112.126|talk]]) 23:08, 25 February 2009 (UTC)
 
Very much agreed, I have found many definitions of this and many other algorithms all with lack of definition of specific terms. <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/66.119.173.210|66.119.173.210]] ([[User talk:66.119.173.210|talk]]) 17:11, 15 May 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
 
== Dijkstra is not greedy ==