Efficient algorithm for parallelizing the computational process to find the shortest paths using the Floyd's algorithm
The article proposes a method to optimize the Floyd's algorithm based on parallelizing its time-consuming stages, choosing the number of threads generated and using multi-core processors. The paper presents the results of the algorithm on various test problems, as well as specifies economic problems where it is possible to effectively use the parallel algorithm.