ViewTube

A plain, precise definition of a graph — and the one idea everything else follows from. We define it exactly, picture it, and pull out ...

The bugs people actually hit with graph traversal — shown, explained, and fixed. A gallery of real mistakes: what they look like, ...

The cost of every graph representation operation in one place — big-O, and the traps that bite in practice. We build the complexity ...

The bugs people actually hit with graph algorithms — shown, explained, and fixed. A gallery of real mistakes: what they look like, ...

How graph representations actually live in memory — the byte-level layout behind the abstraction. We map the abstract picture ...

The invariants of graph traversal: the facts that must stay true after every operation. We state each invariant plainly and show how ...

The invariants of graph representations: the facts that must stay true after every operation. We state each invariant plainly and ...

The invariants of graph algorithms: the facts that must stay true after every operation. We state each invariant plainly and show ...

Practice with graph algorithms: work the problems yourself, then check the worked solutions. Hands-on exercises to turn ...

Before the how, the why: what problem graph traversal solves, and what it costs you to get it wrong. We start from a concrete ...

The bugs people actually hit with graph representations — shown, explained, and fixed. A gallery of real mistakes: what they look ...

Graph Algorithms in action: each core operation walked step by step — the idea, the code, and the cost. We take the operations ...

How graph traversal actually lives in memory — the byte-level layout behind the abstraction. We map the abstract picture onto real ...

A tight recap of graph traversal: the mental model, the operations, and the costs — everything worth keeping. The essential ...

Adding one undirected edge in both representations — and the bug that quietly turns an undirected graph into a directed one.

Breadth-first search explores like a ripple on a pond: everything one step away, then everything two steps away. We take BFS at ...

The contract behind graph algorithms: what you must guarantee going in, and what you can count on coming out. We state the ...

The same depth-first walk with an explicit stack instead of recursion — including the two things recursion was quietly doing for you ...

Depth-first search plunges down one path until it dead-ends, then backs up: the cave, not the pond. We predict the discovery order ...

Practice with graph representations: work the problems yourself, then check the worked solutions. Hands-on exercises to turn ...