Finding the shortest path by Adhwarjee's algorithm and comparison of this powerful method with Dijkstra's algorithm
by Dilip Kumar Adhwarjee
International Journal of Mathematics in Operational Research (IJMOR), Vol. 13, No. 2, 2018

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.

Online publication date: Tue, 14-Aug-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com