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.Ordinary 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 tell me? Two-way: you can walk each path in either direction, A to B or B to A.
  • What do they want? Three things: the vertices, the edges, and what a weight should mean. No lengths are given, so there is nothing to work out with numbers.
Céim

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

Networks as Mathematical Models

A network models objects as vertices, connections as edges or directed arcs, and quantities such as travel time as weights.

Why it matters

Keeping directions and weights faithful to the situation prevents you from recommending forbidden or slower routes.

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 tell me? Two-way: you can walk each path in either direction, A to B or B to A.
    • What do they want? Three things: the vertices, the edges, and what a weight should mean. No lengths are given, so there is nothing to work out with numbers.
  2. Understand

    • How do I picture it?
    • Draw one dot for each building: A, B, C.
    • Draw one line for each path: A to B, and B to C.
  3. Reduce

    • Which edges belong in the model? A–B and B–C, no arrows: One edge with no arrow for each two-way path given, and no others.
    • Where do I start?
    • One vertex per building, one edge per path. The exam lists 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, and did I answer it?
    • 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. No A–C edge, so no made-up trip ✓