Networks, SMB-010

Starting at vertex `A`, identify all the different paths that finish at vertex `D`, using only three edges. (2 marks)

--- 3 WORK AREA LINES (style=lined) ---
Starting at vertex `A`, identify a cycle route? (1 mark)

--- 1 WORK AREA LINES (style=lined) ---
Explain the difference between a cycle and a circuit route. (1 mark)

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

Show Answers Only

i. `text{Three edge paths from}\ A–D:`

`ACED, ABCD, ABED, AECD`

ii. `text{Cycle: a path that ends at the same vertex without}`

`text{repeating any.}`

`text{Possible cycles (many examples exist in this network):}`

`ABEA, ABCEA, ACBA, …`

iii. `text{A circuit is a path that begins and ends at the same vertex.}`

`text{A cycle begins and ends at the same vertex, without}`

`text{repeating any vertices.}`

Show Worked Solution