Deykstra alqoritmi

Deykstra alqoritmi — qovşaqlar arasında ən qısa yolları tapmaq üçün alqoritm. 1956-cı ildə kompüter alimi Edsger Deykstra tərəfindən hazırlanmış və üç il sonra nəşr edilmişdir.^[1]^[2]^[3]

İstinadlar

↑ Richards, Hamilton. "Edsger Wybe Dijkstra". A.M. Turing Award. Association for Computing Machinery. 21 October 2017 tarixində arxivləşdirilib. İstifadə tarixi: 16 October 2017. At the Mathematical Centre a major project was building the ARMAC computer. For its official inauguration in 1956, Dijkstra devised a program to solve a problem interesting to a nontechnical audience: Given a network of roads connecting cities, what is the shortest route between two designated cities?
↑ Frana, Phil. "An Interview with Edsger W. Dijkstra". Communications of the ACM. 53 (8). August 2010: 41–47. doi:10.1145/1787234.1787249.
↑ Dijkstra, E. W. "A note on two problems in connexion with graphs". Numerische Mathematik. 1. 1959: 269–271. CiteSeerX 10.1.1.165.7577. doi:10.1007/BF01386390.

[1] Richards, Hamilton. "Edsger Wybe Dijkstra". A.M. Turing Award. Association for Computing Machinery. 21 October 2017 tarixində arxivləşdirilib. İstifadə tarixi: 16 October 2017. At the Mathematical Centre a major project was building the ARMAC computer. For its official inauguration in 1956, Dijkstra devised a program to solve a problem interesting to a nontechnical audience: Given a network of roads connecting cities, what is the shortest route between two designated cities?

[Dijkstra_Interview-2] Frana, Phil. "An Interview with Edsger W. Dijkstra". Communications of the ACM. 53 (8). August 2010: 41–47. doi:10.1145/1787234.1787249.

[Dijkstra1959-3] Dijkstra, E. W. "A note on two problems in connexion with graphs". Numerische Mathematik. 1. 1959: 269–271. CiteSeerX 10.1.1.165.7577. doi:10.1007/BF01386390.

[1]

[2]

[3]