TY - JOUR
AU - Abbas, Qaiser
AU - Hussain, Qasim
AU - Zia, Tehseen
AU - Mansoor, Arfan
PY - 2018/07/30
Y2 - 2024/02/23
TI - REDUCED SOLUTION SET SHORTEST PATH PROBLEM: CAPTON ALGORITM WITH SPECIAL REFERENCE TO DIJKSTRA’S ALGORITHM
JF - Malaysian Journal of Computer Science
JA - MJCS
VL - 31
IS - 3
SE - Articles
DO - 10.22452/mjcs.vol31no3.1
UR - https://ejournal.um.edu.my/index.php/MJCS/article/view/12730
SP - 175-187
AB - <p>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. </p>
ER -