Is it possible to do Matrix route computation with the java library?
I am currently doing each one to one request after another. But algorithmically it could be mouch more efficient to do a one to many or many to many computation like described in
Efficient many-to-many path planning and the Traveling Salesman Problem on road networks
by Jörg Roth