REDUCED SOLUTION SET SHORTEST PATH PROBLEM: CAPTON ALGORITM WITH SPECIAL REFERENCE TO DIJKSTRA’S ALGORITHM

Main Article Content

Qaiser Abbas Qasim Hussain Tehseen Zia Arfan Mansoor

Abstract

To find the shortest path between the nodes of a graph, different algorithms like Bellman-Ford, Dijkstra, Floyd-Warshall and Johnson exist. However, in this paper, the issue of shortest path problem with special reference to Dijkstra’s algorithm is presented. An idea of shortlisting the appropriate nodes in a graph is proposed and presented, which is then used to find the shortest path with the help of Dijkstra’s algorithm. This complete work -named Capton algorithm- provides a solution to single source shortest path problem with minimized time complexity as compared to Dijkstra’s algorithm. 

Article Details

How to Cite
ABBAS, Qaiser et al. REDUCED SOLUTION SET SHORTEST PATH PROBLEM: CAPTON ALGORITM WITH SPECIAL REFERENCE TO DIJKSTRA’S ALGORITHM. Malaysian Journal of Computer Science, [S.l.], v. 31, n. 3, p. 175-187, july 2018. ISSN 0127-9084. Available at: <https://ejournal.um.edu.my/index.php/MJCS/article/view/12730>. Date accessed: 11 dec. 2018. doi: https://doi.org/10.22452/mjcs.vol31no3.1.
Section
Articles