A Survey of Shortest-Path Algorithms

    arXiv: Data Structures and Algorithms, Volume abs/1705.02044, 2017.

    Cited by: 5|Bibtex|Views8|Links
    EI

    Abstract:

    A shortest-path algorithm finds a path containing the minimal cost between two vertices in a graph. A plethora of shortest-path algorithms is studied in the literature that span across multiple disciplines. This paper presents a survey of shortest-path algorithms based on a taxonomy that is introduced in the paper. One dimension of this t...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments