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.Ordinary 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=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.

Read it once, slowly. Then copy it onto your page.
  • What is going on? Three vertices joined by edges. Undirected: no arrows, so every edge works both ways. A–B carries 8 and B–C carries 13.
  • What else is there? A direct edge from A to C, with weight 205. Same two ends, different way to go.
  • What do they want? The weight of A–B–C, this route exactly. Not the shortest route: no comparing, no choosing.
Céim

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

Vertices, Edges, Weights, Paths & Cycles

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.

Why it matters

Distinguishing these features helps you follow the specified route rather than count edges or include unused connections.

The worked example

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.

How the worked example goes

  1. Read

    • What is going on? Three vertices joined by edges. Undirected: no arrows, so every edge works both ways. A–B carries 8 and B–C carries 13.
    • What else is there? A direct edge from A to C, with weight 205. Same two ends, different way to go.
    • What do they want? The weight of A–B–C, this route exactly. Not the shortest route: no comparing, no choosing.
  2. Understand

    • How do I picture it?
    • Three dots, A, B, C, with each weight written on its edge.
    • Trap: a weight is not the length you draw. A–C can look short on the page and still carry 205.
  3. Reduce

    • Which weights go into the weight of the route A–B–C? A–B and B–C: 8 and 13: Read two letters at a time, A–B–C gives 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 as you travel.
    • Start at A with 0. Travel A to B: the total is now 8.
    • Travel B to C: add 13. The total is now 21.
  5. Check

    • Is it right?
    • Work back: 21 − 8 = 13, the weight of B–C ✓
    • Another way: all three edges total 8 + 13 + 205 = 226. Take away the unused A–C: 226 − 205 = 21 ✓