[英]How turn restrictions in k-shortest paths algorithm in pgRouting
I want to turn restrictions in k-shortest paths in pgRouting. 我想在pgRouting中打开k最短路径的限制。 I calculate one path using pgr_trsp function now, but it gives only one route.
我现在使用pgr_trsp函数计算一条路径,但它仅给出一条路径。 I need several shortests paths and turn restriction.
我需要几个最短路径和转弯限制。
pgRouting does not have that functionality today. pgRouting今天没有该功能。 The best you can do today is write a wrapper that calls pgr_trsp multiple times.
您今天可以做的最好的事情就是编写一个包装,该包装多次调用pgr_trsp。
There is additional work we want to do on trsp to convert it to boost along the lines of the work done on dijkstra in version 2.1.0 but it is not a priority at the moment without some funding. 我们还想对trsp进行其他工作,以将其转换为与版本2.1.0中对dijkstra所做的工作类似的方法,但目前没有任何资金,这并不是一个优先事项。
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.