Group of Possible Shorter Paths from Source to Destination
Tarak Paul, Abhoy Chand Mondal · 2015
This paper clips a reduced graph from a graph, and redefined it into levels. Then find the set of shorter paths from Source to Destination. Source node as root in the first level and destination node as leafs in different levels of the graph. This paper formulates an algorithm which provides other shorter paths from source to destination. The graph may represent network lines for transferring packets, pipeline for transfering liquid and transportation links. The proposed algorithm finds the shortest path and discovers other shorter paths from source to destination with lesser traffic. The selection of node is done using GIS because it is capable enough to express the connectivity of node with one another. The proposed algorithm is compared with Dijksra’s Algorithm and the results are satisfactory. Simulated results are formulated using Matlab. The result assures the potential of the Algorithm.