FLOYD–WARSHALL ALGORITHM FOR SHORTEST ROUTE CALCULATION BETWEEN LATVIA'S CITIES

Authors

  • Raivis Gavars Rezekne Academy of Technologies (LV)
  • Einārs Netlis-Galejs Rezekne Academy of Technologies (LV)
  • Jānis Artūrs Lazdiņš Rezekne Academy of Technologies (LV)
  • Ilmārs Kangro Rezekne Academy of Technologies, Mg.math., Dr.paed., assistant professor (LV)

DOI:

https://doi.org/10.17770/het2019.23.4397

Keywords:

Algorithms, C , Dijkstra, Floyd-Warshall, programming

Abstract

The Floyd–Warshall algorithm is a good choice for computing paths between all pairs of vertices indense graphs, in which most or all pairs of vertices are connected by edges. For sparse graphs with non-negative edgeweights, a better choice is to use Dijkstra's algorithm from each possible starting vertex. Also, a very good thing is that thesolution is very accurate, when using a computer. In this paper, the authors tried to apply a solution using C++programming language to make possible many entries.

Downloads

Download data is not yet available.

References

C++ [online] [Skatīts 10.04.2019.] Pieejams: https://msdn.microsoft.com/en-us/en-en/library/kx37x362.aspx

Overview of the .NET Framework [online] [Skatīts 14.04.2019.]

Pieejams: https://msdn.microsoft.com/en-us/library/zw4w595w(v=vs.110).aspx

Floyd-Warshall Algorithm | Shortest Path Algorithm [Skatīts 04.04.2019.] https://www.gatevidyalay.com/floyd-warshall-algorithm-shortest-path-algorithm/

Latvijas pilētu saraksts.[Skatīts 14.04.2019.]Pieejams:http://www.pilsetas.lv/pilsetas

Deikstras algoritma paskaidrojums. [Skatīts 14.04.2019.]Pieejams:www.politeh.lv/home/download/deikstras.doc

Downloads

Published

2019-04-24

Issue

No. 23 (2019): Human. Environment. Technology

Section

Information Technologies

How to Cite

[1]
R. Gavars, E. Netlis-Galejs, J. A. Lazdiņš, and I. Kangro, “FLOYD–WARSHALL ALGORITHM FOR SHORTEST ROUTE CALCULATION BETWEEN LATVIA’S CITIES”, HET, no. 23, pp. 31–37, Apr. 2019, doi: 10.17770/het2019.23.4397.