Revision as of 10:05, 7 April 2024 edit AnomieBOT (talk \| contribs) Bots 6,860,181 edits m Dating maintenance tags: {{Merge from}} ← Previous edit		Revision as of 19:30, 20 April 2024 edit undo J.O.L. (talk \| contribs) 8 edits m →Secondary sources: Updating Cormen reference to 4th edition Next edit →
Line 202: {{Cite book\|first1=Jørgen \|last1=Bang-Jensen\|first2=Gregory\|last2=Gutin\|year=2000\|title=Digraphs: Theory, Algorithms and Applications\|edition=First \|isbn=978-1-84800-997-4\|chapter=Section 2.3.4: The Bellman-Ford-Moore algorithm\|publisher=Springer \|url=http://www.cs.rhul.ac.uk/books/dbook/}} {{cite journal\|first=Alexander\|last=Schrijver\|title=On the history of combinatorial optimization (till 1960)\|pages=1–68\|publisher=Elsevier\|journal=Handbook of Discrete Optimization\|year=2005\|url=http://homepages.cwi.nl/~lex/files/histco.pdf}} {{Introduction to Algorithms}}, ~~Second~~Fourth Edition. MIT Press ~~and McGraw-Hill~~, ~~2001~~2022. {{ISBN\|978-0-262-~~03293~~04630-75}}. Section 2422.1: The Bellman–Ford algorithm, pp. ~~588–592~~612–616. Problem ~~24–1, pp. 614–615. Third Edition. MIT Press, 2009. {{ISBN\|978-0-262-53305-8}}. Section 24.1: The Bellman–Ford algorithm~~22–1, pp. ~~651–655~~640. {{cite book \| first1 = George T. \| last1 = Heineman \| first2 = Gary \| last2 = Pollice \| first3 = Stanley \| last3 = Selkow \| title= Algorithms in a Nutshell \| publisher=[[O'Reilly Media]] \| year=2008 \| chapter=Chapter 6: Graph Algorithms \| pages = 160–164 \| isbn=978-0-596-51624-6 }} *{{cite book\|last1=Kleinberg\|first1=Jon\|author1-link=Jon Kleinberg\|last2=Tardos\|first2=Éva\|author2-link=Éva Tardos\|year=2006\|title=Algorithm Design\|___location=New York\|publisher=Pearson Education, Inc.}}

Bellman–Ford algorithm: Difference between revisions