Content deleted Content added
ToneDaBass (talk | contribs) No edit summary |
|||
Line 11:
If both loops cycle directly through the number of vertexes (on the top loop) and on the edges (the second one), how come it would be "forever"? In such a loop there's no way it will be infinit. Or am I picturing the whole thing wrong? <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/87.196.85.225|87.196.85.225]] ([[User talk:87.196.85.225|talk]]) 02:02, 19 February 2009 (UTC)</span><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
== 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.
== Zero weight cycles ==
| |||