commit

Author: EeeUnS

README.md

@@ -8,25 +8,25 @@ Ch 2,4,6,7,8 [Sort](./1~8sort)
 
 Ch 4 [Divide-and-Conquer](./docs/ch4/readme.md)
 
-Ch 9 [Medians and Order Statistics](./docs/ch4/readme.md)
+Ch 9 [Medians and Order Statistics](./docs/ch9/readme.md)
 
 ## III Data Structures 
 
 CH 10 Data Structures
 
-Ch 12 [Binary Search Trees](./docs/ch4/readme.md)
+Ch 12 [Binary Search Trees](./docs/ch12/readme.md)
 
 CH 11 Hash Tables
 
-Ch 13 [Red-Black Trees](./docs/ch4/readme.md)
+Ch 13 [Red-Black Trees](./docs/ch13/readme.md)
 미완 작동x
 
 ## IV Advanced Design and Analysis Techniques
 
-Ch 15 [Dynamic Programming](./docs/ch4/readme.md)
+Ch 15 [Dynamic Programming](./docs/ch15/readme.md)
 
 
-Ch 16 [Greedy Algorithms](./docs/ch4/readme.md)
+Ch 16 [Greedy Algorithms](./docs/ch16/readme.md)
 미완
 
 ## V Advanced Data Structures
@@ -37,40 +37,40 @@ Ch 19 Fibonacci Heaps
 
 Ch 20 van Emde Boas Trees
 
-Ch 21 [Data Structures for Disjoint Sets](./docs/ch4/readme.md)
+Ch 21 [Data Structures for Disjoint Sets](./docs/Graph/readme.md)
 
 ## VI Graph Algorithms(22~26)
 
-Ch 22.1~3 [BFS,DFS](./docs/ch4/readme.md)
+Ch 22.1~3 [BFS,DFS](./docs/Graph/22_123.md)
 
-Ch 22.4 [Topological Sort](./docs/ch4/readme.md)
+Ch 22.4 [Topological Sort](./docs/Graph/22_4_DAG.md)
 
-Ch 22.5 [Strongly connected component](https://github.com/EeeUnS/introduction_to_algorithms/blob/master/22~26Graph/22.5_SCC.md)
+Ch 22.5 [Strongly connected component](./docs/Graph/22_5_SCC.md)
 
-Ch 23 [Minimum Spaning Tree](https://github.com/EeeUnS/introduction_to_algorithms/blob/master/22~26Graph/23.MST.md)
+Ch 23 [Minimum Spaning Tree](./docs/Graph/23_MST.md)
 
-Ch 24 [Single Source Shortest Paths](https://github.com/EeeUnS/introduction_to_algorithms/blob/master/22~26Graph/24.SSSP.md)
+Ch 24 [Single Source Shortest Paths](./docs/Graph/24_SSSP.md.md)
 
-Ch 25 [All-Pairs Shortest Paths](./docs/ch4/readme.md)
+Ch 25 [All-Pairs Shortest Paths](./docs/Graph/25_all_pairs_shortest_paths.md.md)
 
 
 ## VII Selected Topics
 
 
 
-Ch 27 [Multithreaded Algorithms](./docs/ch4/readme.md)
+Ch 27 [Multithreaded Algorithms](./docs/ch27/readme.md)
 미완 작동x
 
-Ch 28 [Matrix Operations](./docs/ch4/readme.md)
+Ch 28 [Matrix Operations](./docs/ch28/readme.md)
 
 29 Linear Programming
 
-Ch 30 [Polynomials and the FFT](./docs/ch4/readme.md)
+Ch 30 [Polynomials and the FFT](./docs/ch30/readme.md)
 미완
 
-Ch 31 [Number-Theoretic Algorithms](./docs/ch4/readme.md)
+Ch 31 [Number-Theoretic Algorithms](./docs/ch31/readme.md)
 
-Ch 32 [String Matching](./docs/ch4/readme.md)
+Ch 32 [String Matching](./docs/ch32/readme.md)
 
 Ch 33 Computational Geometry