We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
REDUCED SOLUTION SET SHORTEST PATH PROBLEM: CAPTON ALGORITM WITH SPECIAL REFERENCE TO DIJKSTRA'S ALGORITHM.
- Authors
Abbas, Qaiser; Hussain, Qasim; Zia, Tehseen; Mansoor, Arfan
- 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.
- Subjects
PROBLEM solving; PATHS &; cycles in graph theory; COMPUTER algorithms; GRAPH theory; EXISTENCE theorems
- Publication
Malaysian Journal of Computer Science, 2018, Vol 31, Issue 3, p175
- ISSN
0127-9084
- Publication type
Article
- DOI
10.22452/mjcs.vol31no3.1