Step 3 of 7 · Worked example · TEACH
0 of 3 done
Work through the example to CHECK to open the problems.
Reach CHECK to open the problems.Higher Level · Applied Maths · Networks, Graphs & Matrices · Step 3Follow the worked example and explain why each modelling and calculation step is valid.
The only edges are A→B, B→C. Can a traveller go from C to A? Justify without adding edges.
The only edges are A → B and B → C.
Can a traveller go from C to A? Justify without adding edges.
Higher Level Applied Maths · Networks, Graphs & Matrices · Step 3 of 7
Edge directions control permitted travel, while connected components group vertices joined by paths.
In exam network problems, distinguishing connectivity from directed reachability prevents unjustified reverse journeys.
The only edges are A → B and B → C. Can a traveller go from C to A? Justify without adding edges.