JOIN
Get Time
forums  Revision History
Search My Post History  |  My Watches  |  User Settings
Forums Tutorial Discussions Assignment Problem and Hungarian Algorithm Re: ambiguous variable Revision History (4 edits)
Re: ambiguous variable (response to post by gorbunov)
Hi, yes, thank you! I already corrected it but to be sure is good!

I'm changing the code to c++ completely and also that the amount of workers/jobs will not be given before runtime. The latter cost me some nerves, too but I also succeeded that now :) When I'm finish (in a few weeks..) I'll post the code for public, maybe someone is interested (sooner or later :).

Anyhow: At the moment I stuck at initializing the labels in
" lx[x] = max(lx[x], cost[x][y]); "

In the tutorial they say lx shall be max(w(x,y)) and ly e.g. be zero respectively:

"Vertex labeling

This is simply a function (for each vertex we assign some number called a label). Let's call this labeling feasible if it satisfies the following condition: . In other words, the sum of the labels of the vertices on both sides of a given edge are greater than or equal to the weight of that edge"

What is meant by "for each vertex we assign some number called a label" ? In my case I conern the distance of two positions, so will this be a label ? But how can each vertex get a label ? Shouldn't it be "a label between two vertices" ? Like the distance between each a position to each other position ?
Sorry for my stupid questions, I'm learning the algorithm (in detail) parallel to the programming what makes it a bit difficult than usual.

Thank you very much in advance!

P.S.: Or is labeling somewhat like:

Assume several devices and a label would be like "parameter of device1 = 18 V" and "parameter of device2 = 7V" ? So getting two labels "18V" and "7V" ?
Re: ambiguous variable (response to post by gorbunov)
Hi, yes, thank you! I already corrected it but to be sure is good!

I'm changing the code to c++ completely and also that the amount of workers/jobs will not be given before runtime. The latter cost me some nerves, too but I also succeeded that now :) When I'm finish (in a few weeks..) I'll post the code for public, maybe someone is interested (sooner or later :).

Anyhow: At the moment I stuck at initializing the labels in
" lx[x] = max(lx[x], cost[x][y]); "

In the tutorial they say lx shall be max(w(x,y)) and ly e.g. be zero respectively:

"Vertex labeling

This is simply a function (for each vertex we assign some number called a label). Let's call this labeling feasible if it satisfies the following condition: . In other words, the sum of the labels of the vertices on both sides of a given edge are greater than or equal to the weight of that edge"

What is meant by "for each vertex we assign some number called a label" ? In my case I conern the distance of two positions, so will this be a label ? But how can each vertex get a label ? Shouldn't it be "a label between two vertices" ? Like the distance between each a position to each other position ?
Sorry for my stupid questions, I'm learning the algorithm (in detail) parallel to the programming what makes it a bit difficult than usual.

Thank you very much in advance!

P.S.: Or is labeling somewhat like:

Assume several devices and a label would be like "parameter of device1 = 18 V" and "parameter of device2 = 7V" ? So getting two labels ?
Re: ambiguous variable (response to post by gorbunov)
Hi, yes, thank you! I already corrected it but to be sure is good!

I'm changing the code to c++ completely and also that the amount of workers/jobs will not be given before runtime. The latter cost me some nerves, too but I also succeeded that now :) When I'm finish (in a few weeks..) I'll post the code for public, maybe someone is interested (sooner or later :).

Anyhow: At the moment I stuck at initializing the labels in
" lx[x] = max(lx[x], cost[x][y]); "

In the tutorial they say lx shall be max(w(x,y)) and ly e.g. be zero respectively:

"Vertex labeling

This is simply a function (for each vertex we assign some number called a label). Let's call this labeling feasible if it satisfies the following condition: . In other words, the sum of the labels of the vertices on both sides of a given edge are greater than or equal to the weight of that edge"

What is meant by "for each vertex we assign some number called a label" ? In my case I conern the distance of two positions, so will this be a label ? But how can each vertex get a label ? Shouldn't it be "a label between two vertices" ? Like the distance between each a position to each other position ?
Sorry for my stupid questions, I'm learning the algorithm (in detail) parallel to the programming what makes it a bit difficult than usual.

Thank you very much in advance!
Re: ambiguous variable (response to post by gorbunov)
Hi, yes, thank you! I already corrected it but to be sure is good!

I'm changing the code to c++ completely and also that the amount of workers/jobs will not be given before runtime. The latter cost me some nerves, too but I also succeeded that now :) When I'm finish (in a few weeks..) I'll post the code for public, maybe someone is interested (sooner or later :).

Anyhow: At the moment I stuck at initializing the labels in
" lx[x] = max(lx[x], cost[x][y]); "

In the tutorial they say lx shall be max(w(x,y)) and ly e.g. be zero respectively:

"Vertex labeling

This is simply a function (for each vertex we assign some number called a label). Let’s call this labeling feasible if it satisfies the following condition: . In other words, the sum of the labels of the vertices on both sides of a given edge are greater than or equal to the weight of that edge"

What is meant by "for each vertex we assign some number called a label" ? In my case I conern the distance of two positions, so will this be a label ? But how can each vertex get a label ? Shouldn't it be "a label between two vertices" ? Like the distance between each a position to each other position ?
Sorry for my stupid questions, I'm learning the algorithm (in detail) parallel to the programming what makes it a bit difficult than usual.

Thank you very much in advance!
Re: ambiguous variable (response to post by gorbunov)
Hi, yes, thank you! I already corrected it but to be sure is good!

I'm changing the code to c++ completely and also that the amount of workers/jobs will not be given before runtime. The latter cost me some nerves, too but I also succeeded that now :) When I'm finish (in a few weeks..) I'll post the code for public, maybe someone is interested (sooner or later :).

Anyhow: At the moment I stuck at initializing the labels in
" lx[x] = max(lx[x], cost[x][y]); "

In the tutorial they say lx shall be the max(w(x,y)) and ly be zero respectively:

"Vertex labeling

This is simply a function (for each vertex we assign some number called a label). Let’s call this labeling feasible if it satisfies the following condition: . In other words, the sum of the labels of the vertices on both sides of a given edge are greater than or equal to the weight of that edge"

What is meant by "for each vertex we assign some number called a label" ? In my case I conern the distance of two positions, so will this be a label ? But how can each vertex get a label ? Shouldn't it be "a label between two vertices" ? Like the distance between each a position to each other position ?
Sorry for my stupid questions, I'm learning the algorithm (in detail) parallel to the programming what makes it a bit difficult than usual.

Thank you very much in advance!