optional · interactive figures

13

Explore: matroids

Greedy run with two independence oracles, one where it is optimal and one where it fails, and an augmenting path of matroid intersection, each replayed from the reference solution.

optional: nothing in the lab depends on itback to the slides

13 · explore

One greedy, two oracles

Try: step through Kruskal on the forests, then switch to the matchings on the path and watch the heavy middle edge block both ends. Static version: greedy and exchange, on one graph.

13 · explore

An augmenting path in the exchange graph

Try: follow the sources, sinks and arcs, then the flip that grows I from one edge to two. Static version: one augmenting path, on three edges.