Analysis of algorithms for shortest path problem in parallel

This article brings out the usefulness of improving classical algorithms, analyzing, and optimizing the efficiency of parallel execution time at any price, depending on the situation of use. It can be said that nowadays the searching algorithms are involved in multiple actions in different domains starting from the data bases, the online searching engine, GPS systems or in the emergency situations. Also these algorithms are to be found in the network where we can talk about real priority schemes and data transfer speed that flatters a lot today. Even in the top management systems these algorithms are very useful today because every decision has an important component of time and the searching for information is direct related with these type of algorithms. This study offers an innovative and efficient approach of Dijkstra's algorithm, Bellman Ford algorithm, Floyd-Warshall algorithm and Viterbi algorithm through parallel programming and analysis of the results obtained in different tests but also a comparison of those searching strategies on graph systems. This study can generate new approaches over those strategies and can generate new discussions over the necessity of improving the old algorithms.