Hi Kaisa, yes, its possible. Please see this issue/discussion: https://github.com/graphhopper/graphhopper/issues/131
Kind Regards, Peter On 16.04.2015 15:28, Kaisa Vent wrote: > Hello, > > I am new to the routing world, however, I somehow managed to pick up rather > complex problem. In our project, we need to compute and store the shortest > paths between every node in road network (many-to-many queries). We currently > partitioned larger road network into smaller areas so we plan to > pre-calculate routes only inside those areas. Still, with approx. 10 000 > nodes, we need to pre-compute many shortest paths. I am hereby curious, if > any of you have tried something similar with GraphHopper or is this even > possible? I read the article > http://algo2.iti.kit.edu/schultes/hwy/distTable.pdf and was wondering if it > is possible in GraphHopper to output shortest paths in many-to-many queries? > I did some research on the Internet, but couldn’t find straightforward > answer. > > Regards, > > Kaisa > _______________________________________________ > GraphHopper mailing list > [email protected] > https://lists.openstreetmap.org/listinfo/graphhopper _______________________________________________ GraphHopper mailing list [email protected] https://lists.openstreetmap.org/listinfo/graphhopper
