feat: use dense gain cache for Jet

KaHIP · May 8, 2024 · 108e6da · 108e6da
1 parent 9ed1d20
commit 108e6da
Show file tree

Hide file tree

Showing 2 changed files with 5 additions and 5 deletions.
diff --git a/kaminpar-shm/refinement/balancer/greedy_balancer.h b/kaminpar-shm/refinement/balancer/greedy_balancer.h
@@ -12,7 +12,7 @@
 #include <tbb/task_arena.h>
 
 #include "kaminpar-shm/datastructures/partitioned_graph.h"
-#include "kaminpar-shm/refinement/gains/sparse_gain_cache.h"
+#include "kaminpar-shm/refinement/gains/dense_gain_cache.h"
 #include "kaminpar-shm/refinement/refiner.h"
 
 #include "kaminpar-common/datastructures/binary_heap.h"
@@ -91,7 +91,7 @@ class GreedyBalancer : public Refiner {
   void initialize(const PartitionedGraph &p_graph) final;
   bool refine(PartitionedGraph &p_graph, const PartitionContext &p_ctx) final;
 
-  void track_moves(SparseGainCache<true> *gain_cache) {
+  void track_moves(DenseGainCache<> *gain_cache) {
     _gain_cache = gain_cache;
   }
 
@@ -145,6 +145,6 @@ class GreedyBalancer : public Refiner {
 
   Statistics _stats;
 
-  SparseGainCache<true> *_gain_cache = nullptr;
+  DenseGainCache<> *_gain_cache = nullptr;
 };
 } // namespace kaminpar::shm
diff --git a/kaminpar-shm/refinement/jet/jet_refiner.cc b/kaminpar-shm/refinement/jet/jet_refiner.cc
@@ -12,7 +12,7 @@
 #include "kaminpar-shm/datastructures/partitioned_graph.h"
 #include "kaminpar-shm/metrics.h"
 #include "kaminpar-shm/refinement/balancer/greedy_balancer.h"
-#include "kaminpar-shm/refinement/gains/sparse_gain_cache.h"
+#include "kaminpar-shm/refinement/gains/dense_gain_cache.h"
 
 #include "kaminpar-common/datastructures/noinit_vector.h"
 #include "kaminpar-common/degree_buckets.h"
@@ -39,7 +39,7 @@ bool JetRefiner::refine(PartitionedGraph &p_graph, const PartitionContext &p_ctx
   SCOPED_TIMER("Jet Refiner");
 
   START_TIMER("Allocation");
-  SparseGainCache<true> gain_cache(_ctx, p_graph.n(), p_graph.k());
+  DenseGainCache<true> gain_cache(_ctx, p_graph.n(), p_graph.k());
   gain_cache.initialize(p_graph);
 
   NoinitVector<BlockID> next_partition(p_graph.n());