Bubble sort, quick sort, bin sort, comparing algorithms
Graphs, digraphs, trees, Euler/Hamiltonian, planarity, adjacency matrices
Kruskal's and Prim's algorithms, minimum connector problems
Dijkstra's algorithm, shortest path in weighted networks
Chinese postman problem, Eulerian graphs, pairing odd vertices
Upper/lower bounds, nearest neighbour, minimum spanning tree bounds
Graphical LP, formulating constraints, objective functions, integer solutions
Simplex tableaux, pivoting, Big-M method, two-stage simplex
Activity networks, earliest/latest times, floats, Gantt charts, scheduling
Maximum flow, minimum cut, max-flow min-cut theorem, super sources/sinks
Bipartite graphs, maximum matching, Hungarian algorithm
Minimax/maximin, stage variables, Bellman's principle