Concept clusters
Related ideas that live chapters apart, pulled onto one page — every factoring technique, every way to solve a quadratic, and more.
Which traversal do I run -- BFS or DFS?
Both visit every reachable vertex; which one actually answers your question depends on what you're asking.
8 concepts →
Connected, k-connected, bridge, cut vertex -- which term?
A graph can fail to hold together in several genuinely different ways; each has its own precise name.
9 concepts →
Which shortest-path algorithm do I run?
The right algorithm is decided entirely by what the edge weights are allowed to be.
9 concepts →
Eulerian vs. Hamiltonian -- every edge once, or every vertex once?
The two questions sound alike and behave completely differently -- one is a clean if-and-only-if, the other only has one-way tests.
11 concepts →
Which graph representation should I use?
Adjacency list, adjacency matrix, or incidence matrix -- the right choice is entirely about which operation you need to be cheap.
5 concepts →