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

add integrity checks

Browse source
This commit is contained in:
Maximilian Keßler 2023-11-06 13:47:16 +01:00
parent bd1de9ef03
commit 4e316ade73
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

@ -230,7 +230,7 @@ void contract_blossom(GraphAttributes & attrs, std::vector<NodeId> const & x_pat
std::tuple<NodeId, size_type, size_type> const blossom_root_description = find_blossom_root_id(attrs, x_path, y_path); std::tuple<NodeId, size_type, size_type> const blossom_root_description = find_blossom_root_id(attrs, x_path, y_path);
update_phialong_blossom_paths(attrs, x_path, y_path, blossom_root_description); update_phialong_blossom_paths(attrs, x_path, y_path, blossom_root_description);
//check_integrity(attrs); check_integrity(attrs);
update_rho(attrs, x_path, y_path, blossom_root_description, outer_unvisited_nodes); update_rho(attrs, x_path, y_path, blossom_root_description, outer_unvisited_nodes);
} }
@ -252,7 +252,7 @@ void maximum_matching_from_initial_matching(Graph const & graph, GraphAttributes
outer_unvisited_nodes.pop(); outer_unvisited_nodes.pop();
for(NodeId neighbor_id : graph.node(id).neighbors()) for(NodeId neighbor_id : graph.node(id).neighbors())
{ {
//check_integrity(graph); check_integrity(attrs);
//std::cout << "Check passed" << std::endl; //std::cout << "Check passed" << std::endl;
if (attrs.is_out_of_forest(neighbor_id)) if (attrs.is_out_of_forest(neighbor_id))
{ {