Tag Info

Hot answers tagged

1

So here are the code and summary of the aforementioned bugs, as requested by @Chris W. Basically they seem to refer to the same issue and to have the same cause, i.e. a problem with the OD cost algorithm. NIM094092 - The OD cost matrix analysis in ArcMap returns different travel time results for one origin if another origin is present. NIM060948 - Time and ...


1

With reference to the answer in the comment above: It is sufficient to use the static Graph. The OverlayGraph is not needed here: Graph graph = new Graph(...) int vertexId = graph.findClosestVertexId(lat, lon); // Find nearest crossing int[] edgeIdxs = graph.findOutgoingEdges(vertexId); edgeIdxs is an array of indexes (pointers) to the edges inside the ...


1

@Adrian, I am really unfamiliar with the pgrouting results, however the documentation is very detailed. My answer is based on a two-step function, which will be very inneficient in SQL but [likely] produces the results. This [untested] solution will NOT optimize which is the best starting point, but will reduce the entire route network to only the edges ...


1

I guess pgRouting would be the best option for you. Could you please have a look at these post and say if this is in general what you are looking for? Creating many origin-destination routes with pgRouting (Answer of Otto Coster) If yes then there would be a additional loop neccessary do the calculations for all destinations



Only top voted, non community-wiki answers of a minimum length are eligible