After the appearance of a mysterious wizard, the bridges of Koni were bewitched. The king summons Sarval's wizards to help him. You are Helm, a wizard willing to solve the problem. Based on graph theory, the player needs to find the path that only passes through each bridge once.

After the appearance of a mysterious wizard, the bridges of Koni were bewitched. The king summons Sarval's wizards to help him. You are Helm, a wizard willing to solve the problem. Based on graph theory, the player needs to find the path that only passes through each bridge once.