A backward single source shortest path algorithm for directed graph

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.