This should clear edges fine.

Not entirely sure about what iterators get invalidated when.
This commit is contained in:
WrinklyNinja
2014-02-09 20:39:51 +00:00
parent 03ccbbe8c8
commit fd2799c215
+4
View File
@@ -827,6 +827,10 @@ void Launcher::OnSortPlugins(wxCommandEvent& event) {
}
//Clear all existing edges from the graph.
std::pair<edge_it, edge_it> edge_range = boost::edges(graph);
for (edge_it it = edge_range.first; it != edge_range.second; ++it) {
boost::remove_edge(*it, graph);
}
//Save edits to the userlist.
BOOST_LOG_TRIVIAL(trace) << "Merging down edits to the userlist.";