Exam-style question
Try this first
A weighted graph has edges A-B = 4, A-C = 1, C-B = 2, B-D = 1 and C-D = 7. What is the shortest distance from A to D?.
- A.4
- B.5
- C.7
- D.8
Model answer
What a good answer should say
- 4
Explanation
Why this works
The shortest route is A to C to B to D, with total distance 1 + 2 + 1 = 4.
Common mistake
No common mistake is linked to this question yet.