**Makes a semi/non-eulerian graph, eulerian by making all vertices even.**

1. Identify odd ordered vertices

2. Construct pairs

3. Form pairing combinations by finding the shortest route between the vertices

4. Select the pairing of least total weight (if there are more than two odd ordered vertices)

5. Draw in new edges

6. Add this weight to the original network total

7. Find a new route starting and ending at the same vertex

*NO. OF POSSIBLE PAIRINGS= ***(n-1) x (n-2) x (n-3)...x 1**

*IF YOU CAN START AND FINISH AT DIFFERENT VERTICES THEN 2 VERTICES CAN BE ODD*

## Comments

No comments have yet been made