This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
|
||||||||
|
Paper Details
Paper Title
Investigation of Bellman-Ford Algorithm, Dijkstra's Algorithm for suitability of SP
Authors
Jitendra Bahadur Singh, R.C.Tripathi
Abstract
For graph edges (weights or distance), source node are defined. Shortest path problems solve by the Algorithms, are called shortest path algorithms in this edges are labeled by a positive real number. Shortest path problems are related with either paths between a source node and destination node i.e. single source shortest path or paths among all pairs of stations i.e. all pairs shortest path. In this paper Bellman–Ford algorithm and Dijkstra's algorithm are discussed and compared the results for small no. of nodes as well as for large no. of nodes. The investigation helps to identify and suggest that which algorithm is used for a particular variant in the shortest path problems.
Keywords- WSN, Bellman–Ford algorithm, Dijkstra's algorithm, SPP, Run Time
Publication Details
Unique Identification Number - IJEDR1801130Page Number(s) - 755-758Pubished in - Volume 6 | Issue 1 | March 2018DOI (Digital Object Identifier) - Publisher - IJEDR (ISSN - 2321-9939)
Cite this Article
Jitendra Bahadur Singh, R.C.Tripathi, "Investigation of Bellman-Ford Algorithm, Dijkstra's Algorithm for suitability of SP", International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.6, Issue 1, pp.755-758, March 2018, Available at :http://www.ijedr.org/papers/IJEDR1801130.pdf
Article Preview
|
|
||||||
|
|
||||||||
