The lecture notes and the exercise books in PDF, with the same numbering of definitions, theorems, examples and exercises as the website. Text and figures are released under CC BY 4.0, the code under the MIT licence.
Directed and undirected graphs and their language: computer representations, the node–arc incidence matrix, paths, cycles and connectivity, trees, breadth-first and depth-first search.
Minimum spanning trees (Kruskal, Prim, the cut and cycle properties) and shortest paths (acyclic graphs, Bellman–Ford, Dijkstra), with potentials as a certificate of optimality.
Network flow models and total unimodularity; maximum flow and minimum cut; minimum cost flow with negative cycles, potentials and reduced costs; transportation, transshipment and assignment problems.