Networks, SMB-002

The following network diagram shows the distances, in kilometres, along the roads that connect six intersections `A`, `B`, `C`, `D`, `E` and `F`.

A cyclist started at intersection `D` and cycled along every road in this network once only. What route would the cyclist take and at which intersection would she finish? (3 marks)

--- 5 WORK AREA LINES (style=lined) ---
What is another name for this type of trail? (1 mark)

--- 1 WORK AREA LINES (style=lined) ---

Show Answers Only

i. `text{Possible trails:}`

`DEFDCBFAB, DEFDCBAFB,`

`DEFBAFDCB, DEFABFDCB`

`text{All routes finish at intersection}\ B.`

ii. `text{Eulerian trail}`

Show Worked Solution

i. `text{Possible trails:}`

`DEFDCBFAB, DEFDCBAFB,`

`DEFBAFDCB, DEFABFDCB`

`text{All routes finish at intersection}\ B.`

ii. `text{Eulerian trail}`