Software-Design

Course Sourse Code of 《Software Design and Development Practice I》
Contents:

1. Week 3
   1.1 Skip List
   1.2 KMP
   1.3 Priority Queue
   1.4 Three Element Tuple
2. Week 5
   2.1 Threading Binary Tree
   2.2 Transition Between Forest and Binary Tree
   2.3 Dynamic Huffman Tree
3. Week 12
   3.1 Graph
   3.1.1 Connection Problem
     3.1.1.1 Undirected Graph Biconnected Problem
     3.1.1.2 Directed Graph Strongly Connected Problem
   3.2.1 Minimum Spinning Tree
     3.2.1.1 Prim
     3.2.1.2 Kruskal
     3.2.1.3 Improvedd Prim
   3.3.1 Shortest Path
     3.3.1.1 Dijstra
     3.3.1.2 Floyd
     3.3.1.3 SPFA
     3.3.1.4 Topological Sorting
   3.2 Search Structure
   3.2.1 AVL Tree
   3.2.2 Red Black Tree
   3.2.3 Hash
4. Week 13
   4.1 Quick Sort
   4.2 Linear Sort
   4.2.1 Counting Sort
   4.2.2 Radix Sort
   4.2.3 Bucket Sort