Johnson's algorithm: Difference between revisions

Revision as of 00:00, 22 September 2007

Revision as of 00:15, 17 February 2008

Line 10:

==References==

* Donald B. Johnson. Efficient algorithms for shortest paths in sparse networks. ''[[Journal of the ACM]]'' 24(1):1–13, January 1977. {{doi|10.1145/321992.321993}}

*{{cite web | title=Johnson's Algorithm | work=AUTHOR(S), "Johnson's algorithm", from Dictionary of Algorithms and Data Structures, Paul E. Black, ed., NIST. | url=http://www.nist.gov/dads/HTML/johnsonsAlgorithm.html | accessdateaccessdaymonth=14 June | accessyear=2005 }}

[[Category:Graph algorithms]]