Skip to content

Commit e6b4d83

Browse files
Update README.md
Signed-off-by: Fabiana 🚀 Campanari <113218619+FabianaCampanari@users.noreply.github.com>
1 parent 23dd2da commit e6b4d83

File tree

1 file changed

+20
-0
lines changed

1 file changed

+20
-0
lines changed

README.md

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1502,8 +1502,28 @@ The **Assignment Problem** aims to allocate *n* tasks to *n* agents (machines, w
15021502
<br>
15031503

15041504

1505+
## 1. {Hungarian Method]() (Step by Step):
15051506

1507+
### [**Step 1](): Subtract Row Minimums**
15061508

1509+
#### Subtract the minimum value in each row from all elements in that row.
1510+
1511+
- Row 1 min: 2 → [0, 2, 1]
1512+
- Row 2 min: 1 → [0, 2, 1]
1513+
- Row 3 min: 2 → [3, 0, 2]
1514+
1515+
<br>
1516+
1517+
#### [**Matrix after row subtraction:**]()
1518+
1519+
| | M1 | M2 | M3 |
1520+
|---------|----|----|----|
1521+
| Task 1 | 0 | 2 | 1 |
1522+
| Task 2 | 0 | 2 | 1 |
1523+
| Task 3 | 3 | 0 | 2 |
1524+
1525+
1526+
<br>
15071527

15081528

15091529

0 commit comments

Comments
 (0)