The roads to rome project from Moovel Labs is a nice visualization of the possibilities with GraphHopper. And it is only the start. While investigating and debugging the quality of alternative routes – a new feature from GraphHopper – we stumbled over the necessity to do a very similar visualizations. The visualization of the so […]

This year goes to an end and it was an exciting year for us, our users and customers. In this blog post we summarize all GraphHopper related activities and wish you happy holidays! GraphHopper Community With the help of our community we’ve now several new features and already over 35 translations! We moved our mailing […]

Benedikt, Philipp and Raphael from Moovel Lab, a subsidiary from Daimler, asked the question “Do all roads really lead to rome” and got astonishing and beautiful results! See the “roads to rome” web site for more details and background information like that they used GraphHopper for the routing. See also the media coverage: Wired.com & Wired.de […]

In our last blog post we elaborated the problem of finding a route through Dublin without passing by any Pub. Rory gave us the idea for this, and now again, pointed us to an article reporting that recently there was a Japanese man trying to visit each and every pub to drink a pint of […]

A long time ago there was a nice blog post How to walk across Dublin without passing a pub from Rory and there was even someone who tried this in real life. Now we thought how this would look like today using GraphHopper instead of the manual process described in the post. It turns out […]

The traveling salesman problem is the problem of finding the shortest possible route through a given set of locations whereby each loaction must only be visited once and the traveling saleman must return to its start location. A very good introduction into traveling salesman problems has been done by William Cook. It is fun to […]