There can be more than one Euler tour on a line. As the starting and ending points change, different Euler tours can be found. The answer to the question of whether there is an Euler tour or an Euler path on a line created in this assignment will be sought. Homework consists of three stages. In the first step, a random graph will be created. In the second stage, the degrees of the points in the created diagram will be checked and whether there is an Euler tour or not. In the third stage, the Euler's tour or path will be found using the Fleury algorithm or trial and error method.

(a): Euler path exists CDEFCBAF (b): There is no Euler path. (c): There is Euler tour: CBAFCDEFC (d): There is no Euler tour.

 Creating the chart, checking the Euler tour and printing the Euler tour should be written as different functions. Additional functions can be used if needed. Detailed information about the stages of the assignment is given below.

Stages

1) Creating the line: The information about how many knots will be in the layout (maximum 100) must be entered by the user from the keyboard. After entering the number of nodes on the keyboard, the connections between the nodes in the layout must be determined. It will be decided whether there are only links between two nodes and the number of links between two nodes should not be more than one. The neighborhood matrix of the layout should be written on the screen. It should be checked that the laying is one piece. If the paving is not a single piece, it should be re-paved.

2) Checking the Euler's tour: According to the above given theorem, it should be investigated whether there is an Euler tour in the one piece sequence that you randomly create. In order to have an Euler tour or path, node degrees must be calculated. At this stage, only the node degrees should be calculated and the information about the node degrees and whether there is an euler tour or path should be printed on the screen.

3) Printing the Euler tour on the screen: If there is an Euler tour or path according to the node degrees, any of these tours or paths should be printed on the screen.
 

B B F E F E () (b) B C E F E () (d)