The shortest path problem based on the data structure has become one of the hot research topics in graph theory. As the basic theory of solving this problem, Dijkstra algorithm has been widely used in ...

We propose two new algorithms called BiLAD and ExactBiLAD for the well-known Single-Constrained Shortest Path (SCSP) problem. It is a fundamental problem in quality-of-service (QoS) routing, where one ...