IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v14y1980i4p343-347.html
   My bibliography  Save this article

Shortest path forest with topological ordering: An algorithm description in SDL

Author

Listed:
  • Dial, Robert
  • Glover, Fred
  • Karney, David
  • Klingman, Darwin

Abstract

This short note presents a formal description of a fast and robust shortest path algorithm. Modeled on an algorithm of Pape (1974), it requires less memory store than most algorithms and at the same time permits arc lengths to range between -[chi] and +[chi]. It is described in a machine processable language called SDL. The note opens with a brief introduction to SDL syntax.

Suggested Citation

  • Dial, Robert & Glover, Fred & Karney, David & Klingman, Darwin, 1980. "Shortest path forest with topological ordering: An algorithm description in SDL," Transportation Research Part B: Methodological, Elsevier, vol. 14(4), pages 343-347, December.
    • Handle: RePEc:eee:transb:v:14:y:1980:i:4:p:343-347
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(80)90014-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. A. Parsakhoo & M. Mostafa, 2015. "Road network analysis for timber transportation from a harvesting site to mills (Case study: Gorgan county - Iran)," Journal of Forest Science, Czech Academy of Agricultural Sciences, vol. 61(12), pages 520-525.

    More about this item

    Statistics

    Access and download statistics

    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:eee:transb:v:14:y:1980:i:4:p:343-347. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.