Euler bridges with NEO4J

The problem is Once upon a time, there was a town called Königsberg. The citizens of that town loved to walk across the bridges of their beloved town. They wondered if there is a way to walk around the city and cross each bridge only once. They tried...