Some origin-destination pairs have no path due to the consideration of forbidden movements (if they have been defined)
The current implementation of Dijkstra's algorithm based on graph exploration and a list of visited nodes does not allow to find the loops. A different handling of the algorithm based on an exploration of possible movements at the node level could compute a path for the problematic ODs
Some origin-destination pairs have no path due to the consideration of forbidden movements (if they have been defined)
The current implementation of Dijkstra's algorithm based on graph exploration and a list of visited nodes does not allow to find the loops. A different handling of the algorithm based on an exploration of possible movements at the node level could compute a path for the problematic ODs