Welcome to my 281 archive!
This notes include implementations of basic data structures: union-find sets, unordered_map by hash table, AVL tree, graph represented by adjacency matrix&list and a lot more with optimization. Also, basic algorithms like Dijkstra's, Prim's, Kruskal's and dp problems are included, both proof sketch and implementation.
If you want to read my lecture notes and found a lot of Chinese words that you could not read, sorry about that!
In [practice-code] I put some implementations of data structure and algorithms sketched in lecture that were not implemented.
I cannot put projects and labs here because it violates the honor code, but I did put some of my ideas and debugging suggestions in [notes-project-optimization] (Again, sorry about that if you have trouble reading that.)