Hi Yang, yes, sure. That optimized calculation is what we are doing in our Matrix Add-on which is then more like O(N+M) with only some O(N*M) parts and is therefor over 10 times faster or in certain scenarios it is even >50 times faster than the brute force approach. Feel free to contact us if you are interested in a trial version, the pricing etc
Kind Regards, Peter On 23.11.2014 08:04, Yang wrote: > Thanks Peter. > > the first link is more of a "brute force" way to do it. as is noted in > the ISSUE, when the end goal is to get the distance matrix, there > could be faster ways than application of NxM pair-wise route(). > > On Sat, Nov 22, 2014 at 6:15 AM, Peter <[email protected] > <mailto:[email protected]>> wrote: > > It is not part of the open source version, though you can create a > distance matrix with GraphHopper > > https://github.com/karussell/optaplanner-graphhopper-example/blob/master/src/main/java/com/graphhopper/optaplanner/Main.java#L41 > > See also this issue: > https://github.com/graphhopper/graphhopper/issues/131 > > Peter > > On 22.11.2014 09:31, Yang wrote: > > this describes the matrix api: > > https://github.com/graphhopper/web-api/blob/master/docs-matrix.md > > > > can I setup the API on my own server? or could you please tell me > > where the matrix computation code is? (I can see the point-to-point > > routing code is in router.route() ) > > > > > > Thanks > > Yang >
_______________________________________________ GraphHopper mailing list [email protected] https://lists.openstreetmap.org/listinfo/graphhopper
