Finding the shortest path by Adhwarjee's algorithm and comparison of this powerful method with Dijkstra's algorithm

Dilip Kumar Adhwarjee

International Journal of Mathematics in Operational Research, 2018, vol. 13, issue 2, 269-279

Abstract: This paper introduces an algorithm for finding the shortest path which is more powerful method than all the existing methods like Dijkstra's algorithm. Adhwarjee's algorithm is introduced to the readers for finding the shortest path. The author gives few steps to find the shortest path. This method takes less standard time than Dijkstra's algorithm. First, Dijkstra's method is explained in brief, which is readily available in books. We will concentrate on the new method of finding the shortest path. Adhwarjee's algorithm needs no table to compute. Simple addition, subtraction and finding minimum, maximum can be done mentally and posted in the network itself. In the network, the reader can see the minimum distance or time which requires to be found out.

Keywords: origin; destination; vertex; shortest path; minimum. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=94058 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:13:y:2018:i:2:p:269-279

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().