卷別
資料結構與演算法
選擇國立臺灣大學 2026 · 考試 · 第 7 題
考科演算法
(4 points) A company needs to assign 3 workers to 3 tasks. Each worker can perform only the tasks listed below:
- Worker : Tasks
- Worker : Task
- Worker : Tasks
Each worker can be assigned to at most one task, and each task to at most one worker. Which of the following statements is true?
- (A)The maximum matching has size 2.
- (B)The maximum matching has size 1.
- (C)No matching exists.
- (D)There exist exactly two distinct maximum matchings.
- (E)There exists a perfect matching.