Comparative Study of Shortest Path Algorithm with Alternating Colors

Abstract

Shortest path algorithm find minimum distance path between source to destination .we use graph to solve shortest path distance problem. Graph is set of Edges and vertices. A graph is a pictorial representation of a set of objects where some pairs of objects are connected by links. Formally, a graph is a pair of sets (V, E), where V is the set of vertices and E is the set of edges, connecting the pairs of vertices.  Undirected graphs have edges that do not have a direction. The edges indicate a two-way relationship, in that each edge can be traversed in both directions. Directed graphs have edges with direction. The edges indicate a one-way relationship, in that each edge can only be traversed in a single direction. Edges contain Wight which is used to calculate shortest path from source to destination .consider example Airline route maps. Vertices represent airports, and there is an edge from vertex A to vertex B if there is a direct flight from the airport represented by A to the airport represented by B. There are different shortest path algorithms which solve shortest path problem. They are Dijkstras, Floyd Warshall, Bellman Ford Algorithm.  Key Words:  Graph, Dijkstras Algorithm, Floyd-Warshall Algorithm, Bellman Ford Algorithm. In this paper, we have developed an algorithim to find out the shortest path of a closed network with the concept of alternating colors. We also explained our proposed algorithm with the help of JAVA programming language.

 Keywords-    Genetic Algorithm  ,  Floyd-Warshall Algorithm, Computer Networks , Dijkstras Algorithm  , Bellman-Ford Algorithm