You implement adjacency structures, then slow down to narrate why each relaxation or visit order is legal. We emphasize drawing the graph before typing.
Included
Layered BFS traces on glass boards
Adjacency list vs matrix comparison lab
Articulation point exercises with counterexamples
Printed adjacency templates for exams
Live debugging of stale visited flags
Short readings on planar intuition (no proofs)
Capstone route audit for a Poti street grid toy model
Outcomes
Explain back-edge classification without memorizing acronyms
Pick BFS vs DFS when stakeholders describe a dependency scan
Document invariants for each traversal pass
Giorgi Beridze
Practice lead for competitive-style graph drills.
FAQ
Will we cover max flow?
We touch Ford-Fulkerson conceptually but do not implement scaling optimisations.
What tooling is expected?
TypeScript or Python is fine; we care about traversal clarity, not syntax sugar.
Limitations?
No GPU or parallel graph frameworks—serial reasoning only.
Experience notes
“Graph Algorithms Studio forced me to narrate DFS out loud; awkward at first, but it stuck for interviews.”
