ベルマン–フォード法 (Japanese Wikipedia)

Analysis of information sources in references of the Wikipedia article "ベルマン–フォード法" in Japanese language version.

refsWebsite

Global rank Japanese rank

415^th place

1,150^th place

4,347^th place

low place

mit.edu

Dimitri P. Bertsekas (1992年3月). “A Simple and Fast Label Correcting Algorithm for Shortest Paths” (PDF). Networks, Vol. 23, pp. 703–709, 1993. 2008年10月1日閲覧。

oreilly.com

safari.oreilly.com

Robert Sedgewick. Algorithms in Java. Third Edition. ISBN 0-201-36121-3. Section 21.7: Negative Edge Weights. http://safari.oreilly.com/0201361213/ch21lev1sec7