Main Article Content

Ezhilmaran D Diwakar Raja A, Harsha Vardhan Reddy D Sakthi Kumar R

Abstract

  The Single-Source Shortest Path problem (SSSP) an explanation  for various networking based problems is in fact a  basic concept of graph theory. The Dijkstra’s and Bellman-Ford are two well accomplished algorithms to solve the problem. Here in this paper, an algorithm called S-algorithm(S stands for Sakthi, meaning power) with enhanced performance will be discussed. The concept of linked-list will be implemented wherein the weights of the graph are stored in the nodes of the linked-lists. Valid data will be portrayed to prove that the proposed algorithm is more efficient than Dijkstra’s and Bellman-Ford’s algorithm.

Article Details