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

iterate over outer verticse, not out-of-forest

Browse source
This commit is contained in:
Maximilian Keßler 2023-11-05 12:38:14 +01:00
parent 229250acca
commit 2cd6dc2c1d
Signed by: max
GPG key ID: BCC5A619923C0BA5
1 changed files with 1 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
edmonds.cpp
View file

@ -30,13 +30,11 @@ std::vector<NodeId> path_to_forest_root(Graph const & graph, NodeId id)
return retval; return retval;
} }
Graph maximum_matching_from_initial_matching(Graph & graph) Graph maximum_matching_from_initial_matching(Graph & graph)
{ {
graph.reset_forest(); graph.reset_forest();
for(NodeId id = 0; id < graph.num_nodes(); ++id) { for(NodeId id = 0; id < graph.num_nodes(); ++id) {
if (graph.is_out_of_forest(id)) if (graph.is_outer(id))
{ {
for(NodeId neighbor_id : graph.node(id).neighbors()) for(NodeId neighbor_id : graph.node(id).neighbors())
{ {