A Survey of Shortest-Path Algorithms
arXiv: Data Structures and Algorithms, Volume abs/1705.02044, 2017.
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
Full Text (Upload PDF)
PPT (Upload PPT)