Talk:Shortest path faster algorithm

This redirect does not require a rating on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Mathematics Low‑priority This redirect is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics Low This redirect has been rated as Low-priority on the project's priority scale. Computer science Mid‑importance This redirect is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science Mid This redirect has been rated as Mid-importance on the project's importance scale. Things you can help WikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (see List of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Hi, I have a book ((in Italian) "Algoritmi e Strutture Dati" by A. Bertossi and A. Montresor, which is the textbook for the course of "Algorithms and Data Structures" at the university of Trento, Italy) that presents (pagg. 211-216) pseudocode which is identical to the one described in this algorithm as a standard implementation for the Bellman-Ford algorithm. After a little bit of research, I have found that this form of Bellman-Ford was proposed by Moore in 1957 (see [1] and [2]) and later found equivalent to Bellman-Ford. Moore's algorithm is so well known, that the Bellman-Ford algorithm is also known as Bellman-Ford-Moore algorithm (this is also mentioned in the incipit of the Wikipedia article about Bellman-Ford). So, I am a little confused by this article. Is there something in this algorithm that I am missing, or is it one of the many variants of Bellman-Ford and should the article be moved in a section of Bellman-Ford? --CristianCantoro (talk) 16:07, 7 February 2018 (UTC)Reply

Valid point, this is in origin an optimization of the Bellman-Ford algorithm, and this is almost never called by this name (SPFA) outside China, where it was popularized by Fanding Duan. As for merge, I am currently undecided; the Bellman-Ford page itself could use some work. The size is not the issue, since there aren't that great of differences in the code. Wyrdwritere (talk) 03:43, 7 April 2024 (UTC)Reply

Hi, I'm relatively new and Algorithms aren't really my strong suit, however I do agree with whoever flagged this article for tone. The section with examples use the term "We" multiple times, and although I don't know the exact policy on it, I assume it's not proper. I would edit it but I don't know if there's any specific things that need to be kept so I figured I'd let someone else do it. Is there a policy against the use of "We", and where would I find it? Thanks Mlayap (talk) 12:34, 28 May 2024 (UTC)Reply