joris
/
maximum-weight-matching
1
0
Fork 0
Code Pull Requests Activity

Minor cleanup

This commit is contained in:
Joris van Rantwijk 2024-11-19 21:25:05 +01:00
parent ab691813b3
commit 082397ef80
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
cpp/mwmatching.h
View File

@ -1231,7 +1231,7 @@ public:
assert(path.edges.size() % 2 == 1); assert(path.edges.size() % 2 == 1);
assert(path.edges.size() >= 3); assert(path.edges.size() >= 3);
// Construct the list of sub-blossoms. // Collect pointers to sub-blossoms.
std::vector<BlossomT*> subblossoms; std::vector<BlossomT*> subblossoms;
subblossoms.reserve(path.edges.size()); subblossoms.reserve(path.edges.size());
for (VertexPair edge : path.edges) { for (VertexPair edge : path.edges) {
@ -1277,8 +1277,8 @@ public:
} }
// Merge concatenable queues. // Merge concatenable queues.
// TODO -- avoid temporary array
std::vector<VertexQueueT*> subqueues; std::vector<VertexQueueT*> subqueues;
subqueues.reserve(subblossoms.size());
for (BlossomT* sub : subblossoms) { for (BlossomT* sub : subblossoms) {
subqueues.push_back(&sub->vertex_queue); subqueues.push_back(&sub->vertex_queue);
} }