Bellman–Ford algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Bellman–Ford algorithm" in English language version.

refsWebsite

Global rank English rank

low place

9,338^th place

179^th place

183^rd place

low place

1^st place

4,347^th place

3,017^th place

1,972^nd place

5,213^th place

741^st place

577^th place

baidu.com

Duan, Fanding (1994). "关于最短路径的SPFA快速算法 [About the SPFA algorithm]". Journal of Southwest Jiaotong University. 29 (2): 207–212.

Schrijver (2005) Schrijver, Alexander (2005). "On the history of combinatorial optimization (till 1960)" (PDF). Handbook of Discrete Optimization. Elsevier: 1–68.

Sedgewick (2002). Sedgewick, Robert (2002). "Section 21.7: Negative Edge Weights". Algorithms in Java (3rd ed.). Addison-Wesley. ISBN 0-201-36121-3. Archived from the original on 2008-05-31. Retrieved 2007-05-28.

See Sedgewick's web exercises for Algorithms, 4th ed., exercises 5 and 12 (retrieved 2013-01-30).

Bang-Jensen & Gutin (2000) Bang-Jensen, Jørgen; Gutin, Gregory (2000). "Section 2.3.4: The Bellman-Ford-Moore algorithm". Digraphs: Theory, Algorithms and Applications (First ed.). Springer. ISBN 978-1-84800-997-4.

Sedgewick (2002). Sedgewick, Robert (2002). "Section 21.7: Negative Edge Weights". Algorithms in Java (3rd ed.). Addison-Wesley. ISBN 0-201-36121-3. Archived from the original on 2008-05-31. Retrieved 2007-05-28.