Improving the shortest path finding algorithm in apache spark graphX

The shortest path finding problem is one of the most important and common problems on graphs. It is also a basic problem applied to solve other problems such as the betweenness centrality problem, the closeness centrality problem... Therefore, in all graph processing platforms, there is a way to solve this problem. Apache Spark GraphX is also. However, the shortest path finding algorithm in GraphX has some drawbacks to discuss more. Therefore, in this paper we analyze some issues in finding the shortest path in GraphX, then we propose two new algorithms to improve for better performance, and finally we compare the performance between the shortest path finding algorithm in GraphX and proposed algorithms.