Networks, SMB-003

The following network diagram has a Eulerian trail.

Starting at vertex `D`, describe one Eulerian trail and at what vertex the trail finishes. (2 marks)

Show Answers Only

`text{Possible trails:}`

`DACEBD, DBECAD`

`text{All Eulerian trails will finish at vertex}\ D.`

Show Worked Solution

`text{Possible trails:}`

`DACEBD, DBECAD`

`text{All Eulerian trails will finish at vertex}\ D.`