A Backward Single Source Shortest Path Algorithm for Directed Graph
D. Jasmine Priskilla1, K. Arulanandam2
1D. Jasmine Priskilla, Ph. D Research Scholar, Research and Development Centre, Bharathiar University, Coimbatore, (Tamil Nadu), India.
2Dr. K. Arulanandam, Head, Department of Computer Applications, GTM College, Gudiyattam, (Tamil Nadu), India.

Manuscript received on 06 August 2019 | Revised Manuscript received on 12 August 2019 | Manuscript published on 30 August 2019 | PP: 2978-2981 | Volume-8 Issue-10, August 2019 | Retrieval Number: J11350881019/2019©BEIESP | DOI: 10.35940/ijitee.J1135.0881019
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: A new directed backward variant of the Single Source Shortest Path algorithm was described in this paper. This algorithm accept that approaching adjacency list of the given graph vertex loads showed up in expanding request. The running time of forward, based strategy algorithm is the best aftereffect of O (n), which are the most ideal forward backward SSSP consequences of Wilson et al. Moreover, the likelihood of the new algorithm additionally requires O (n) time. This is an equally improved version of exponentially and polynomial small probability derived by Wilson et al.
Keywords: Shortest Path, Backward Algorithm, Directed Graph, Directed Backward Algorithm.
Scope of the Article: Graph Algorithms and Graph Drawing