Content deleted Content added
ToneDaBass (talk | contribs) No edit summary |
m Signing comment by ToneDaBass - "" |
||
Line 14:
== Negative weight cycles ==
Please cite a source saying that Bellman-Ford can be used to find simple paths on networks with negative cycles, or else correct this section. All sources I can find say that simple paths cannot be found on a network with negative cycles. This includes [http://reference.wolfram.com/mathematica/Combinatorica/ref/BellmanFord.html Wolfram's implementation] of Bellman-Ford, as well as Yen's 1971 paper "Finding the k shortest loopless paths in a network" published in Management Science (vol 17, no 11). Corman's book cited in the article also states that Bellman-Ford can't find paths in networks with negative cycles. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:ToneDaBass|ToneDaBass]] ([[User talk:ToneDaBass|talk]] • [[Special:Contributions/ToneDaBass|contribs]]) 02:15, 3 August 2010 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->
== Zero weight cycles ==
| |||