I feel like puking some more math so that's what I'm gonna do: let's throw down combinatorial optimization, matching algorithms, approximation algos, flow duality, matching polytope, bipartite graphs, polyhedral combinatorics, minimax, minimum cuts, lp optimization, cayley's formula, prufer codes, simplex method, primal dual relationship, ellipsoid algorithm, separation oracle, ah let's stick some raman scattering and optical cavity nmr in here, and then speak of np completeness, weak flow, transportation and network models along with assignment models and variants, transshipment model, CPM and Pert, and some parameteric programming and combinatorics, and analytic hierarchy process, with some labeled trees, rooted trees, ordered trees with complete and partial ordering, huffman trees, data compression blah blah blah my little brain is about to explode into a forest of spanning directed trees and some minimum spanning trees and their applications in phylogeny and eulerian and hamiltonian cycles, dna sequencing, and np hardness, and randomized algorithms including randomization, vertex covers, and hitting and cover times, matching via matrix inversion, and some algorithmic game theory meh...