Login

Search the forums now!

Welcome, Guest. Please login or register.

November 01, 2025, 10:15:30 am
Pages: [1]   Go Down

Author Topic: Hungarian Algorithm Problem  (Read 1540 times)  Share 

0 Members and 1 Guest are viewing this topic.

Yendall

  • Victorian
  • Forum Leader
  • ****
  • Posts: 808
  • Respect: +38
Hungarian Algorithm Problem
« on: July 18, 2012, 08:42:28 pm »
0
This question/topic is annoying me like crazy.
Here are my workings for a question from Essential Further Mathematics (Chapter 24D - Q1b)
The graph that says 'orginal graph' is actually after the original graph has been altered through row reduction.


Down the bottom left hand corner are the actual answers. Why am I getting so many allocations? I know that I can't use my first solution because you can cover all zero elements with 3 lines, and the minimum amount of lines is 4.

Any help would be appreciated.

EDIT: I realised I incorrectly reduced the third column by 1 rather than 0. This changes the final answer. I shouldn't be so careless next time, apologies.
« Last Edit: July 20, 2012, 09:53:49 am by Yendall »
Logged
2013 - 2016: Bachelor of Computer Science @ RMIT
2017 - 2018: Master of Data Science @ RMIT
ΟΟΟΟ
VCE '12: | English | I.T: Applications | I.T: Software Development | Music Performance Solo |  Further Mathematics | Studio Arts |
Pages: [1]   Go Up