Hi!
today i learn hungarian algorithm for maximum weighted graph . is the below condition true:
"the cost for the vertex are positive at the end of algo if the weight of edge are
non-negative."
thank's for your replay!
Hi!
I_love_natalia
|
13 лет назад,
#
|
0
Hungarian. I'm lovin it.
→
Ответить
|