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

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

The only edges are A→B, B→C. Can a traveller go from C to A? Justify without adding edges.

The only edges are A → B and B → C.

Can a traveller go from C to A? Justify without adding edges.

Read it once, slowly. Then copy it onto your page.
  • What is going on? Two links, A → B and B → C. Each has an arrow: it may be used only in the arrow's direction, like a one-way street.
  • What is fixed? The only edges: there are no others. And without adding edges: you may not invent a link to make a trip work.
  • What do they want? Yes or no: can you get from C to A? Then a reason, because they say justify.
Céim

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

Directed, Undirected, Connected & Disconnected Graphs

Edge directions control permitted travel, while connected components group vertices joined by paths.

Why it matters

In exam network problems, distinguishing connectivity from directed reachability prevents unjustified reverse journeys.

The worked example

The only edges are A → B and B → C. Can a traveller go from C to A? Justify without adding edges.

How the worked example goes

  1. Read

    • What is going on? Two links, A → B and B → C. Each has an arrow: it may be used only in the arrow's direction, like a one-way street.
    • What is fixed? The only edges: there are no others. And without adding edges: you may not invent a link to make a trip work.
    • What do they want? Yes or no: can you get from C to A? Then a reason, because they say justify.
  2. Understand

    • How do I picture it?
    • Sketch: two one-way streets
    • A ──→ B ──→ C
  3. Reduce

    • Every trip from C starts with one arc. So what do you look for first? An arc out of C: A trip from C must begin on an arc leaving C. If there is none, the trip cannot start.
    • Where do I start?
    • List every arc that points out of C. If the list is empty, no trip from C can begin, so none reaches A.
  4. Solve

    • List the arcs out of C.
    • Arcs out of C: none.
    • B → C points into C. It cannot be used as C → B.
  5. Check

    • Is it right?
    • Arcs at C
    • in: 1, out: 0