The paper presents a new dynamic direction restricted algorithm based on the Dijkstra algorithm, direction restricted algorithm and area restricted algorithm for computing shortestpath from one node ...

An efficient and flexible algorithm is presented for finding a k shortest loopless path with distinct initial links from one node to each other node. Low-order polynomial bounds are established for ...