max/edmonds-matching-algorithm
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

fix: typo

Browse source
This commit is contained in:
Maximilian Keßler 2023-11-06 13:51:56 +01:00
parent 4e316ade73
commit 1d75066eea
Signed by: max
GPG key ID: BCC5A619923C0BA5
2 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
src/edmonds.cpp
View file

@ -117,7 +117,7 @@ void augment(GraphAttributes & attrs, std::vector<NodeId> const & x_path, std::v
for(size_t i = 1; i < y_path.size(); i += 2) for(size_t i = 1; i < y_path.size(); i += 2)
{ {
attrs.mu[y_path[i]] = y_path[i+1]; attrs.mu[y_path[i]] = y_path[i+1];
attrs.mu[y_path[i+1]] = x_path[i+1]; attrs.mu[y_path[i+1]] = y_path[i];
} }
attrs.reset_forest(); attrs.reset_forest();
collect_exposed_vertices(attrs, outer_unvisited_nodes); collect_exposed_vertices(attrs, outer_unvisited_nodes);

2
src/graph_attributes.h
View file

@ -49,7 +49,7 @@ namespace ED
inline inline
bool GraphAttributes::is_outer(NodeId const id) const { bool GraphAttributes::is_outer(NodeId const id) const {
return mu[id] == id or phi[mu[id]] == mu[id]; return mu[id] == id or phi[mu[id]] != mu[id];
} }
inline inline