Skip to content
← All pathways
Computer ScienceAdvancedRevision 1

Trees, Graphs & Pathfinding

Build from ordered trees to graph traversal, disjoint sets, and weighted shortest paths while tracking the invariant each algorithm preserves.

5 stepsAbout 100 minutesSelect and justify a tree or graph technique for connectivity and pathfinding problems.

A lab, not a slideshow

How each chapter works

1 · Predict

Commit to what you think the system will do before pressing play.

2 · Observe

Change one variable and watch the state, algorithm, or model respond.

3 · Explain

State the invariant or principle, then prove it in the checkpoint.

Saved learning progress

Your ordered steps

Checking saved progress…

Chapter progress

0%

Next: Trace a binary search tree

Continue
  1. Next suggested
    Step 1

    Step 1Experiment

    Trace a binary search tree

    Predict first, change one input, then explain the state change you observe.

    Open simulation
  2. Step 2

    Step 2Experiment

    Compare graph traversals

    Predict first, change one input, then explain the state change you observe.

    Open simulation
  3. Step 3

    Step 3Experiment

    Compress connected components

    Predict first, change one input, then explain the state change you observe.

    Open simulation
  4. Step 4

    Step 4Experiment

    Relax weighted paths with Dijkstra

    Predict first, change one input, then explain the state change you observe.

    Open simulation
  5. Step 5

    Step 5Prove

    Trees and graphs checkpoint

    Use the evidence from the chapter to pass a server-scored knowledge check.

    Take knowledge check