Step 2 of 7 · Worked example · TEACH

← Networks, Graphs & Matrices

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 2

Follow the worked example and explain why each modelling and calculation step is valid.

An undirected network has route A–B–C with weights AB=4, BC=9. The direct edge AC has weight 201. 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 = 4 and B–C = 9. The direct edge A–C has weight 201.

Find the weight of the route A–B–C, not the shortest route.

Read it once, slowly. Then copy it onto your page.
  • What is going on? A network of three vertices. Undirected: every edge can be used either way. The edge A–B carries 4 and B–C carries 9.
  • What else is there? A direct edge from A to C, with weight 201. It joins the same two ends, but by a different route.
  • What do they want? The weight of A–B–C, this route exactly as named. Not the shortest route: no comparing routes, no choosing.
Céim

Higher Level Applied Maths · Networks, Graphs & Matrices · Step 2 of 7

Vertices, Edges, Weights, Paths & Cycles

Vertices are points, edges connect them, and a route's weight is the sum of the weights of the edges it traverses.

Why it matters

In exam network questions, distinguishing a specified path from a direct edge or a cycle prevents you from adding the wrong weights.

The worked example

An undirected network has route A–B–C with weights A–B = 4 and B–C = 9. The direct edge A–C has weight 201. Find the weight of the route A–B–C, not the shortest route.

How the worked example goes

  1. Read

    • What is going on? A network of three vertices. Undirected: every edge can be used either way. The edge A–B carries 4 and B–C carries 9.
    • What else is there? A direct edge from A to C, with weight 201. It joins the same two ends, but by a different route.
    • What do they want? The weight of A–B–C, this route exactly as named. Not the shortest route: no comparing routes, no choosing.
  2. Understand

    • How do I picture it?
    • Sketch the three vertices with the weight written on each edge.
    • The route as named
  3. Reduce

    • Which edge weights go into the weight of the route A–B–C? A–B and B–C: 4 and 9: The pairs side by side in A–B–C are A–B and B–C. Those two are travelled; A–C is not.
    • Where do I start?
    • Call the route's weight W. Then W = weight of A–B + weight of B–C. The edge A–C stays out.
  4. Solve

    • Add the two edge weights.
    • W = A–B + B–C
    • W = 4 + 9
  5. Check

    • Is it right?
    • Work back: 13 − 4 = 9, the weight of B–C ✓
    • Another way: all three edges total 4 + 9 + 201 = 214. Take away the unused A–C: 214 − 201 = 13 ✓