Route inspection

Question 1

if you are given 4 odd node how many pairings are there

Answer 1

3 pairings

Question 2

State the edges that will need to be traversed twice

Answer 2

1. correctly identify degree of nodes
2. list the odd nodes
3. check if starts/ finishes with nodes in list
4. consider all possible pairings
   (exclude start and finish if there)
5. choose pairings of least weight
6. choose the pair of least of weight
7. Traverse these arcs twice

Question 3

Note: if a graph starting node is odd and current finishing node is even.

How do we manipulate route inspection

Answer 3

We aim to make the finishing node odd
- so include this node in list
- consider pairings
- choose the pair of least weight
- Add to the original weight= new length

This would make the odd nodes even and the finishing even node odd.