Hello, > The first problem is called "many to many shortest path calculation" can be solved from graphhopper Graphhopper already includes a matrix routing? Consider me impressed. Could you hint me in the direction of how to use it? Seems I missed that one. Regards, Flo