Skip to content
PlayOwl

Coding · Grade 11

Graphs and Network Problems

Learners model networks (bus stops, study partners, prerequisites, roads) as directed, undirected and weighted graphs stored as adjacency lists, trace breadth-first and depth-first search, find shortest paths with BFS and Dijkstra's algorithm, and answer network questions with reachability, connected components and topological ordering.

  • 4 lessons
  • About 105 minutes
  • Check what you learned: 8 questions
  • Ways to answer: choose an answer, trace code, match pairs, type a number, put in order and sort into groups
Try it now (no account) One of the five free starter courses Open in PlayOwl

What learners will discover

  • Model problems as graphs and represent them with adjacency lists or matrices.
  • Trace breadth-first and depth-first search and explain the data structures they use.
  • Find shortest paths with BFS (fewest edges) and Dijkstra's algorithm (least total weight).
  • Apply graph algorithms to network problems such as reachability, components and prerequisite ordering.

Lessons

  1. Modelling with graphs 5 steps2 practiceabout 20 min
  2. Breadth-first and depth-first search 5 steps3 practiceabout 24 min
  3. Shortest paths 5 steps3 practiceabout 24 min
  4. Network problems 4 steps3 practiceabout 18 min
  5. Check what you learned 8 questions at the end

Keep exploring

More 11th grade coding

Guide for grown-ups