algorithm - "Assignment Problem" solution question -
i reading through solution assignment problem here: http://www.topcoder.com/tc?module=static&d1=tutorials&d2=hungarianalgorithm
i understand o(n3) solution), had question easier o(n4) solution.
perhaps misunderstood notation, when goes modify weights in step 2 -- why doesn't weight w1->j2 increase same way w2->j1 increases.
can better explain notation in rule defined in
it looks 2 logical symbols supposed "and" , "xor" respectively. xor symbol chosen looks more inclusive or, typo. see http://en.wikipedia.org/wiki/exclusive_or of less confusing alternatives.
with interpretation, have following possibilities:
- neither
i
norj
inv
. first case. i
inv
,j
not. second case.i
not inv
,j
is. second case.- both
i
,j
inv
. third case.
as see, cases covered, , there no ambiguity.
Comments
Post a Comment