An efficient algorithm for the single-source shortest path problem in graph theory Ghent University
The Single-Source Shortest Path problem (SSSP), known as the basis of many application areas, is a fundamental matter in graph theory. In this paper, a new efficient algorithm named Li-Qi (LQ) is proposed for SSSP to find a simple path of minimum total weights from a designated source vertex-to each vertex. The algorithm is based on the ideas of the queue and the relaxation, The main differences between this strategy with the Breadth-first ...