Each Graph Theory class would mention the Königsberg problem once. The problem is simple but the solution isn’t. Basically, there was a city in Prussia (old Germany) called Königsberg (now known as Kaliningrad and it is now in Russia) with 7 bridges over a river. The problem statement was to find a path that could cross each bridge just once in such a way that one could return back to the point where one started.
