I am trying to find the shortest route between several O-D pairs. So, i just tried to do this by taking only one trip to see how it works. But, the shortest route seems to be not shortest.
And there is no any one way segments along this route. What might be the reason behind this ?
And next problem is , when I tried to place a line barrier for this same problem.Following error appears. In this I wanted to find a path that goes inside the buffer. Although there is a path, it shows no path is available.
أكثر...
And there is no any one way segments along this route. What might be the reason behind this ?
And next problem is , when I tried to place a line barrier for this same problem.Following error appears. In this I wanted to find a path that goes inside the buffer. Although there is a path, it shows no path is available.
أكثر...