- [Basic graph representations](src/graph/mod.rs): adjacency lists, minimum spanning tree, Euler path, disjoint set union

- [Network flows](src/graph/flow.rs): Dinic's blocking flow, Hopcroft-Karp bipartite matching, min cost max flow

- [Connected components](src/graph/connectivity.rs): 2-edge-, 2-vertex- and strongly connected components, bridges, articulation points, topological sort, 2-SAT

- [GCD Math](src/math/mod.rs): canonical solution to Bezout's identity

- [Arithmetic](src/math/num.rs): rational and complex numbers, linear algebra, safe modular arithmetic

- [FFT](src/math/fft.rs): fast Fourier transform, number theoretic transform, convolution