Revision as of 14:25, 7 April 2024 edit Lowercase sigmabot III (talk \| contribs) Bots, Page movers 2,448,349 edits m Archiving 1 discussion(s) to Talk:Bellman–Ford algorithm/Archive 1) (bot ← Previous edit		Latest revision as of 01:13, 10 June 2024 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,633 edits →Proposed Merger: SPFA into Optimizations: Reply Tag: Reply
Line 86: Pretty much all in the title. The Moore Optimization has a whole article, which takes its name after that in the Fanding Duan article (1994) which popularized it in China. The relevance of having a whole article for it, since its worst case is the same as Bellman-Ford, does not seem to meet the standard. [[User:Wyrdwritere\|Wyrdwritere]] ([[User talk:Wyrdwritere\|talk]]) 03:51, 7 April 2024 (UTC) :{{done}} —[[User:David Eppstein\|David Eppstein]] ([[User talk:David Eppstein\|talk]]) 01:13, 10 June 2024 (UTC)

Talk:Bellman–Ford algorithm: Difference between revisions