# 113-1 演算法 上課講義筆記

## [Introduction [M: Ch. 1; C: Ch. 1,2] (.5 week: 09/03a)](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/BJ7PbjwXye)

## [Mathematical Induction [M: Ch. 2; C: Ch. 4] (1.5 weeks: 09/03b, 09/10)](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/rycVkbDQ1x)

## [Analysis of Algorithms [M: Ch. 3; C: Ch. 2,3,4] (1 week: 09/24*) ]

## Design by Induction [M: Ch. 5] (1 week: 10/01)

## Data Structures: A Supplement [M: Ch. 4; C: Ch. 6,13,19] (.5 week: 10/08a*)

## [Searching and Sorting [M: Ch. 6; C: Ch. 6,7,8,9] (1.5 weeks: 10/08b, 10/15)](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/HJfT6v_Q1g)

## [String Processing [M: Ch. 6; C: Ch. 32] (1 week: 10/22*)](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/HyuSWhOXJl)

## Midterm (2024/10/29)

## [Graph Algorithms: Basic [M: Ch. 7; C:Ch.20,21,22,23] (1.5 weeks: 11/05, 11/12a*) ](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/SyURKh_mkx)

## [Graph Algorithms: Advanced [M: Ch. 7; C:Ch.20,24,25] (1.5 weeks: 11/12b, 11/19)](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/H1QEuYiQ1g)

## [Dynamic Programming [C: Ch.14] (1 week: 11/26*)](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/SkVdhvumyg)

## [Reduction [M: Ch. 10; C: Ch. 29] (.5 week: 12/03a)](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/HyNhAR1NJe)

2 Bipartite Matching
* Matching
* Bipartite Matching
* 問題 1. 給定一個雙方圖 G = (V, E, U )，找出 G maximum matching(具有最多邊的匹配)。
* 極大匹配 (Maximal Matching)：
* 最大匹配 (Maximum Matching)：

3 Network Flows
* The Network Flow Problem 網路流量問題
4 Bipartite Matching to Network Flow

5 Linear Programming
1. 符號說明（Notations）
2. 線性規劃（Linear Programming, LP）
3. 線性規劃的目標

6 Network Flow to Linear Programming
1. 從網絡流問題到線性規劃
2. 線性規劃與最大流之間的對應

## [NP-Completeness [M: Ch. 11; C: Ch. 34] (1.5 weeks: 12/03b, 12/10*)](https://hackmd.io/@RuH9UULLRMuRo2iEsweIqA/SJk9qbzVyg)

## Final (2024/12/17)