IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v13y2018i2p269-279.html
   My bibliography  Save this article

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

Author

Listed:
  • Dilip Kumar Adhwarjee

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.

Suggested Citation

  • Dilip Kumar Adhwarjee, 2018. "Finding the shortest path by Adhwarjee's algorithm and comparison of this powerful method with Dijkstra's algorithm," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 13(2), pages 269-279.
    • Handle: RePEc:ids:ijmore:v:13:y:2018:i:2:p:269-279
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=94058
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijmore:v:13:y:2018:i:2:p:269-279. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.