Revision as of 21:09, 2 August 2025 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,723 edits →Secondary sources: sfn whitelist ← Previous edit		Latest revision as of 02:40, 25 August 2025 edit undo OAbot (talk \| contribs) Bots 643,717 edits m Open access bot: url-access=subscription updated in citation with #oabot.
Line 86: == Proof of correctness == The correctness of the algorithm can be shown by [[mathematical induction\|induction]]:<ref name="web.stanford.edu"/><ref>{{Cite journal \|last=Dinitz \|first=Yefim \|last2=Itzhak \|first2=Rotem \|date=2017-01-01 \|title=Hybrid Bellman–Ford–Dijkstra algorithm \|url=https://www.sciencedirect.com/science/article/pii/S1570866717300011 \|journal=Journal of Discrete Algorithms \|volume=42 \|pages=35–44 \|doi=10.1016/j.jda.2017.01.001 \|issn=1570-8667\|url-access=subscription }}</ref> '''Lemma'''. After ''i'' repetitions of ''for'' loop,

Bellman–Ford algorithm: Difference between revisions