Step 2 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.Ordinary Level · Applied Maths · Networks, Graphs & Matrices · Step 2Follow the worked example and explain why each modelling and calculation step is valid.
An undirected network has route A–B–C with weights AB=8, BC=13. The direct edge AC has weight 205. Find the weight of the specified route A–B–C, not the shortest route.
An undirected network has route A–B–C with weights A–B = 8 and B–C = 13. The direct edge A–C has weight 205.
Find the weight of the route A–B–C, not the shortest route.
Ordinary Level Applied Maths · Networks, Graphs & Matrices · Step 2 of 7
Vertices are points, edges are connections, weights are values attached to edges, a simple path repeats no vertex, and a cycle returns to its start without repeating other vertices.
Distinguishing these features helps you follow the specified route rather than count edges or include unused connections.
An undirected network has route A–B–C with weights A–B = 8 and B–C = 13. The direct edge A–C has weight 205. Find the weight of the route A–B–C, not the shortest route.