Methods for finding shortest paths on graphs in organizational and economic systems and their implementation
Vladimir Michailovich Ramzaev, И. Н. Хаймович, Ilya Martynov · 2019
The article implements the functions in Postgre SQL DBMS, finding the shortest paths on graphs, using the wave algorithm method, the Dijkstra’s method and the Floyd method. The authors determined models of dependencies of the running time of implementations of the shortest-path search algorithms on graphs on the number of graph vertices experimentally. A comparison of the data obtained as a result of the study was carried out to find the best applications of implementations of the shortest path search algorithms in the Postgre SQL DBMS.