fixed correctness of gp

bnb/greedy_packing.cpp

@@ -6,7 +6,7 @@ bool do_swap = true;
 
 greedy_packing::greedy_packing(graph& g, incremental_bfs& ibfs, bool with_flow)
     : graph_(g), i_bfs(ibfs), with_flow_(with_flow){
-        max_a = (graph_.num_nodes()+1)/2;
+        max_a = (graph_.num_nodes())/2;
 };
 
 void greedy_packing::reset(std::vector<node_id>& a, std::vector<node_id>& b) {
@@ -46,10 +46,12 @@ void greedy_packing::bfs(){
         for(node_id v : neighbors){
             if(visited[v] == false){
                 //falls nicht(mit_flow angegeben und knoten unter den flow_edges ist)dann push in zu x
-                if(!(with_flow_ && (std::find(flow_edges.begin(), flow_edges.end(), graph_.get_edge_id(node, v)) != flow_edges.end())))
+                if(!(with_flow_ && (std::find(flow_edges.begin(), flow_edges.end(), graph_.get_edge_id(node, v)) != flow_edges.end()))){
                     x_.push_back(v);
+                    visited[v] = true;
+                }
             }
-            visited[v] = true;
+            
         }
     }
 
@@ -88,12 +90,15 @@ void greedy_packing::run(){
     while (found_new_element) {
         found_new_element = false;
         for (std::vector<node_id>& partition : partitioning) {
-            for (node_id node : graph_.get_adjacency(partition.back())) {
+            node_id v = partition.back();
+            for (node_id node : graph_.get_adjacency(v)) {
                 if (!visited[node]) {
-                    partition.push_back(node);
-                    visited[node] = true;
-                    found_new_element = true;
-                    break;
+                    if(!(with_flow_ && (std::find(flow_edges.begin(), flow_edges.end(), graph_.get_edge_id(node, v)) != flow_edges.end()))){
+                        partition.push_back(node);
+                        visited[node] = true;
+                        found_new_element = true;
+                        break;
+                    }
                 }
             }
         }