Open AccessA Backward Single Source Shortest Path Algorithm For Directed Graph
Author(s) -
D. Jasmine Priskilla,
K. Arulanandam
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.j1135.0881019
Subject(s) - adjacency list , algorithm , shortest path problem , vertex (graph theory) , shortest path faster algorithm , floyd–warshall algorithm , computer science , yen's algorithm , graph algorithms , graph , adjacency matrix , path (computing) , time complexity , combinatorics , mathematics , k shortest path routing , dijkstra's algorithm , programming language
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.