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

Authors: Dilip Kumar Adhwarjee

Addresses: Dr. B.C. Roy Engineering College, Durgapur, India; Maulana Abul Kalam Azad University of Technology, Durgapur, pin 713206, District – Burdwan, West Bengal, India

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.

DOI: 10.1504/IJMOR.2018.094058

International Journal of Mathematics in Operational Research, 2018 Vol.13 No.2, pp.269 - 279

Received: 29 Jun 2016
Accepted: 27 Dec 2016

Published online: 14 Aug 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article