Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · 2021

Solution of the transport problem by "Dijkstra's algorithm"

O.O. Arhipova, A.N. Kaplunov, L.YU. SHevyrev

Cited by 1Open access

Abstract

This article discusses the solution of the transport problem using the "Dijkstra algorithm" to determine the shortest routes of transportation. The transport problem is solved for intra-city routes.

Cite this paper

APA 7

Arhipova, O., Kaplunov, A., & SHevyrev, L. (2021). Solution of the transport problem by "Dijkstra's algorithm". https://doi.org/10.18411/lj-01-2021-51

MLA 9

Arhipova, O.O., et al. “Solution of the transport problem by "Dijkstra's algorithm".” 2021, https://doi.org/10.18411/lj-01-2021-51.

Chicago

Arhipova, O.O., A.N. Kaplunov, and L.YU. SHevyrev. 2021. “Solution of the transport problem by "Dijkstra's algorithm".” https://doi.org/10.18411/lj-01-2021-51.

Harvard

Arhipova, O., Kaplunov, A. and SHevyrev, L. (2021) ‘Solution of the transport problem by "Dijkstra's algorithm"’. Available at: https://doi.org/10.18411/lj-01-2021-51.

BibTeX
@article{arhipova2021solution,
  title = {{Solution of the transport problem by "Dijkstra's algorithm"}},
  author = {Arhipova, O.O. and Kaplunov, A.N. and SHevyrev, L.YU.},
  year = {2021},
  doi = {10.18411/lj-01-2021-51}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers