Problem #WSP-000146

Problems Graph theory

Problem

The city of Konigsberg has seven bridges as depicted on the layout below. \[\includegraphics[scale=0.5]{WSP-000146.png}\] Is it possible for a great mathematician Leonard Euler to have an excursion in Konigsberg visiting all islands and land banks, but crossing each bridge only once?