From 8de09bb38d860bd9e46cbbe06564180a56c78712 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Maximilian=20Ke=C3=9Fler?= Date: Mon, 6 Nov 2023 22:25:21 +0100 Subject: [PATCH] remove unneeded output --- src/edmonds.cpp | 7 +++---- 1 file changed, 3 insertions(+), 4 deletions(-) diff --git a/src/edmonds.cpp b/src/edmonds.cpp index 003c803..c1fd9f7 100644 --- a/src/edmonds.cpp +++ b/src/edmonds.cpp @@ -121,7 +121,7 @@ __attribute__((noinline)) void augment(GraphAttributes & attrs, std::vector const & x_path, std::vector const & y_path, std::stack & outer_unvisited_nodes) { - std::cout << "Augment" << std::endl; + //std::cout << "Augment" << std::endl; // Paths are disjoint -> augment attrs.mu[x_path.front()] = y_path.front(); attrs.mu[y_path.front()] = x_path.front(); @@ -230,7 +230,7 @@ __attribute__((noinline)) void contract_blossom(GraphAttributes & attrs, std::vector const & x_path, std::vector const & y_path, std::stack & outer_unvisited_nodes) { - std::cout << "Contract blossom" << std::endl; + //std::cout << "Contract blossom" << std::endl; std::tuple 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); @@ -257,10 +257,9 @@ void maximum_matching_from_initial_matching(Graph const & graph, GraphAttributes for(NodeId neighbor_id : graph.node(id).neighbors()) { check_integrity(attrs); - std::cout << "Check passed" << std::endl; + //std::cout << "Check passed" << std::endl; if (attrs.is_out_of_forest(neighbor_id)) { - std::cout << "Grow forest" << std::endl; // Grow Forest attrs.phi[neighbor_id] = id; assert(attrs.mu[neighbor_id] != neighbor_id);