**Route inspection urg...**

1. List the order of each of the vertices (how many edges are going out of it)

2. Highlight/List all the odd vertices - *there will be* an even number of odd vertices!

3. Form all possible pairs of odd vertices e.g. odd vertices = A,B,C,D so the pairs could be: AB CD or AC BD or AD BC

4. Now you need to find the value for going along each of the pairs of vertices. Sometimes you may have to go via another vertex if AB doesn't have a direct route; go A**E**B then add the weight of AE and EB together! Use the graph to help you and list **all** repeated arcs.

5. Do this for all the pairs of odd vertices and see which combination has the lowest value e.g AB CD = 110, AC BD = 230 and AD BC = 175. So AB CD has the lowest value.

6. You can now draw on the acrs you will go along twice or repeat!

7. You can now write down the order/route starting and ending at the same vertex - List it as a string of letters, making sure ever edge in covered and going down the repeated egdes.

## Comments

No comments have yet been made