THE TOOLKIT / 03
Field Notes.
A little theory. A working example. Something new to try.
TRAVERSAL
Two ways to explore a graph ↗
Breadth first or depth first? Follow the same connections with two different strategies, and see why order matters.
SHORTEST PATHS
The shortest route is not always the fewest steps ↗
What changes when connections have a cost? A practical look at Dijkstra’s algorithm, relaxation, and nonnegative weights.
NETWORK ANALYSIS
Reading the shape of a network ↗
Components, degrees, and density reveal different things. Learn what these measurements say, and what they leave out.