Shortest Path Algorithm Research Paper

Shortest Path Algorithms

The shortest path algorithms are shortest way of finding the mean distances between any two vertices. There are several algorithms for finding the shortest path between any two vertices in a weighted graph. A weighted graph is a way of finding multiple paths on a single condition by which we can easily select the shortest possible path.

Some of the names shortest path Algorithms are:

• SHIMBEL invented in 1955 which works on information networks.

• FORD invented in 1956 works on economics of transportation.

• LEZOREK, GRAY, JOHNSON, LADEW, MEAKER, PETRY, SEITZ inveted algorithm in 1957 for combat development department of the Army electronic proving ground.

• DANTZING invented in1958 used in linear algebra.

• BELLMAN

As in discuss above the procedure will require vertices so we mark each vertices with different locations and select any one of them as initial point so the program can easily starts its iterations by comparing each to the remaining vertices and gives us out an appropriate result that shows us a desire location from where according to the situation we can easily buy a house that will be near to all the possible places that we normally go in our daily routine life. By assuming this example, you may think why we are using this algorithm, no doubt the distance is far enough to calculate practically and we don’t have to use this algorithm but what else if we have such conditions where the distance is infinite so how would the distance will be calculate so it is the best way of calculating this algorithms on larger scales. Applications of shortest path algorithms are mostly found in:

• Maps from where we can easily mark out our desire path by a shortest possible