演算法›Ch4 圖論演算法
第 2 題/共 111 題
◀ AL 2/111
2. 二分圖匹配、Maximum Matching
#AL-04-002易二分圖匹配Maximum Matching

A company needs to assign 3 workers to 3 tasks. Each worker can perform only the tasks listed below:

  • Worker W1W_1: Tasks T1,T2T_1, T_2
  • Worker W2W_2: Task T1T_1
  • Worker W3W_3: Tasks T2,T3T_2, T_3

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?

📄 台大115
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法
本章題號 · 1–20 / 111