AWhat changed
Gave a method for finding a shortest path in a graph with positive edge lengths; the original note also treats construction of a minimum-total-length tree.
Scientific scope
Gave a method for finding a shortest path in a graph with positive edge lengths; the original note also treats construction of a minimum-total-length tree. Scope limitation: This record is anchored to the 1959 publication and the author’s retrospective. It does not extend the method unconditionally to negative edge weights or adjudicate priority across all minimum-spanning-tree work.
Evidence
Assessment uses the catalogue-linked source evidence for the stated contribution. This record is anchored to the 1959 publication and the author’s retrospective. It does not extend the method unconditionally to negative edge weights or adjudicate priority across all minimum-spanning-tree work.
Contributors
- Edsger W. Dijkstra · SCIENCE: Named source contributor; exact labor shares are not measured.
- Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik 1, 269–271 (1959)
- Dijkstra, Citation Classic retrospective on the 1959 graph paper, EWD841a, University of Texas author archive
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction