Step 1 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 1

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

Three buildings A, B and C have two-way paths A–B and B–C. Define vertices, edges and an appropriate meaning for edge weights.

Three buildings A, B and C have two-way paths A–B and B–C.

Define the vertices, the edges and a suitable meaning for the edge weights.

Read it once, slowly. Then copy it onto your page.
  • What is going on? Three buildings, A, B and C. One path joins A to B, one joins B to C. Nothing joins A straight to C.
  • What does this word give me? Two-way: each path can be walked in either direction, A to B or B to A.
  • What do they want? Three things: the vertices, the edges, and what a weight on an edge should mean. No path lengths are given, so there is nothing to calculate.
Céim

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

Networks as Mathematical Models

A network models objects as vertices and their direct connections as edges or directed arcs.

Why it matters

In an exam, preserving permitted movements and choosing meaningful weights prevents you from solving the wrong routing problem.

The worked example

Three buildings A, B and C have two-way paths A–B and B–C. Define the vertices, the edges and a suitable meaning for the edge weights.

How the worked example goes

  1. Read

    • What is going on? Three buildings, A, B and C. One path joins A to B, one joins B to C. Nothing joins A straight to C.
    • What does this word give me? Two-way: each path can be walked in either direction, A to B or B to A.
    • What do they want? Three things: the vertices, the edges, and what a weight on an edge should mean. No path lengths are given, so there is nothing to calculate.
  2. Understand

    • How do I picture it?
    • Draw a dot for each building and a line for each path.
    • Sketch: three dots, two lines
  3. Reduce

    • Which edges belong in the model? A–B and B–C, no arrows: One undirected edge for each two-way path given, and no others.
    • Where do I start?
    • One vertex per building, one edge per path given. The exam writes these as two sets: V for vertices, E for edges.
  4. Solve

    • Write the model.
    • V = {A, B, C}
    • E = {A–B, B–C}
  5. Check

    • Is it right?
    • 3 buildings, 3 vertices. 2 paths, 2 edges ✓
    • Trace A → B → C, then back C → B → A. Both work, because the paths are two-way ✓