Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

fix(object_merger): fix shadowVariable #7941

Merged
merged 1 commit into from
Jul 10, 2024
Merged

fix(object_merger): fix shadowVariable #7941

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions perception/object_merger/src/association/solver/successive_shortest_path.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -328,12 +328,12 @@ void SSP::maximizeLinearAssignment(

#ifndef NDEBUG
// Check if the potentials are feasible potentials
for (int v = 0; v < n_nodes; ++v) {
for (auto it_incident_edge = adjacency_list.at(v).cbegin();
it_incident_edge != adjacency_list.at(v).cend(); ++it_incident_edge) {
for (int w = 0; w < n_nodes; ++w) {
for (auto it_incident_edge = adjacency_list.at(w).cbegin();
it_incident_edge != adjacency_list.at(w).cend(); ++it_incident_edge) {
if (it_incident_edge->capacity > 0) {
double reduced_cost =
it_incident_edge->cost + potentials.at(v) - potentials.at(it_incident_edge->dst);
it_incident_edge->cost + potentials.at(w) - potentials.at(it_incident_edge->dst);
assert(reduced_cost >= 0);
}
}
Expand Down
Loading