Skip to content

C++ HIDDEN_JUNCTION datacheck cleanup#212

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

Merged
yakra merged 1 commit into from
Apr 26, 2019
Merged

C++ HIDDEN_JUNCTION datacheck cleanup #212

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
9 changes: 3 additions & 6 deletions siteupdate/cplusplus/classes/GraphGeneration/HighwayGraph.cpp
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -107,12 +107,9 @@ class HighwayGraph
}
// if >2 edges, flag HIDDEN_JUNCTION, mark as visible, and do not compress
if (wv.second->incident_c_edges.size() > 2)
{ std::list<Waypoint*>::iterator it = wv.second->first_waypoint->colocated->begin();
Waypoint *dcw = *it; // "datacheck waypoint"
for (it++; it != wv.second->first_waypoint->colocated->end(); it++)
if (dcw->root_at_label() > (*it)->root_at_label())
dcw->root_at_label() = (*it)->root_at_label(); //TODO: WHAT THE...? How is this actually working? (Or is it?)
datacheckerrors->add(dcw->route, dcw->label, "", "", "HIDDEN_JUNCTION", std::to_string(wv.second->incident_c_edges.size()));
{ datacheckerrors->add(wv.first->colocated->front()->route,
wv.first->colocated->front()->label,
"", "", "HIDDEN_JUNCTION", std::to_string(wv.second->incident_c_edges.size()));
wv.second->visibility = 2;
continue;
}
Expand Down