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

remove checkes

Browse Source
This commit is contained in:
Maximilian Keßler 2023-11-05 19:00:56 +01:00
parent 1effd569ca
commit d5f01f5c70
Signed by: max
GPG Key ID: BCC5A619923C0BA5
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/edmonds.cpp
View File

@ -102,7 +102,7 @@ void maximum_matching_from_initial_matching(Graph & graph)
{ {
for(NodeId neighbor_id : graph.node(id).neighbors()) for(NodeId neighbor_id : graph.node(id).neighbors())
{ {
check_integrity(graph); //check_integrity(graph);
//std::cout << "Check passed" << std::endl; //std::cout << "Check passed" << std::endl;
if (graph.is_out_of_forest(neighbor_id)) if (graph.is_out_of_forest(neighbor_id))
{ {
@ -200,7 +200,7 @@ void maximum_matching_from_initial_matching(Graph & graph)
graph.node(node_id).rho = blossom_root_id; graph.node(node_id).rho = blossom_root_id;
} }
} }
check_integrity(graph); //check_integrity(graph);
} }
} }
} }