@article{Abbas_Hussain_Zia_Mansoor_2018, title={REDUCED SOLUTION SET SHORTEST PATH PROBLEM: CAPTON ALGORITM WITH SPECIAL REFERENCE TO DIJKSTRA’S ALGORITHM}, volume={31}, url={https://ejournal.um.edu.my/index.php/MJCS/article/view/12730}, DOI={10.22452/mjcs.vol31no3.1}, abstractNote={<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.&nbsp;</p>}, number={3}, journal={Malaysian Journal of Computer Science}, author={Abbas, Qaiser and Hussain, Qasim and Zia, Tehseen and Mansoor, Arfan}, year={2018}, month={Jul.}, pages={175–187} }