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

##plugins.themes.bootstrap3.article.main##

##plugins.themes.bootstrap3.article.sidebar##

PDF
Published Oct 4, 2013
Ezhilmaran D Diwakar Raja A, Harsha Vardhan Reddy D Sakthi Kumar R
innovative journal publication pvt. ltd

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.

How to Cite

AN EFFICIENT S-ALGORITHM FOR FINDING SINGLE SOURCE SHORTEST PATH PROBLEM IN GRAPH THEORY. (2013). Asian Journal of Current Engineering and Maths, 2(5). https://informaciontechnologica.com/index.php/ajcem/article/view/52
Abstract 157 | PDF Downloads 360

##plugins.themes.bootstrap3.article.details##

Issue
Vol 2 No 5 (2013): ASIAN JOURNAL OF CURRENT ENGINEERING AND MATHS
Section
Articles

COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY

 

All paper submissions must carry the following duly signed by all the authors:

“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.”

How to Cite

AN EFFICIENT S-ALGORITHM FOR FINDING SINGLE SOURCE SHORTEST PATH PROBLEM IN GRAPH THEORY. (2013). Asian Journal of Current Engineering and Maths, 2(5). https://informaciontechnologica.com/index.php/ajcem/article/view/52