AN EFFICIENT S-ALGORITHM FOR FINDING SINGLE SOURCE SHORTEST PATH PROBLEM IN GRAPH THEORY

Cite this:
Sakthi Kumar R, E. D. D. R. A. H. V. R. D. (2013). AN EFFICIENT S-ALGORITHM FOR FINDING SINGLE SOURCE SHORTEST PATH PROBLEM IN GRAPH THEORY. Asian Journal of Current Engineering and Maths, 2(5). Retrieved from http://innovativejournal.in/index.php/ajcem/article/view/52
© 2022 Interactive Protocols
Article Views
152
Altmetric
1
Citations
-

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.

 Special Issue

Article Metrics Graph

Content

Section

Source