Optimization Possibilities for the Shortest-Path Algorithms in the Context of Large Volumes of Information

The purpose of this research article is to create an optimized purpose for the Dijkstra algorithm, with a superior degree of efficiency. This research proposes also, in the first instance, an innovative and efficient analysis of the Dijkstra's and Roy-Floyd algorithms. This proposed method is useful in various application cases, such as information grouping systems associated with a graph with a small but high node density. The analysis part explains the strategies chosen for today's parallel solutions and comparisons with the implemented method. It can be stated that the parallelization solution proposed in the article is specific to a configuration. There will be also presented other strategies considering the grouping systems for the tests with many nodes and edges. The algorithm for determining the shortest path is presented and tested at the multi-language level in different contexts and scenarios.