��ö�Ծ������������ bridge problem

a mathematical problem in graph theory, solved by Leonhard Euler, to show that it is impossible to cross all seven bridges of the Prussian city of ��ö�Ծ������������ in a continuous path without recrossing any bridge.