From a2e8f6927cfc349a12ff270bb36a08f060af5761 Mon Sep 17 00:00:00 2001
From: Chen Wang <jhwjhw0123@gmail.com>
Date: Fri, 8 Mar 2024 14:59:38 -0500
Subject: [PATCH] The right way to do graph subsampling

---
 tools/process_stream.cpp | 10 ++++------
 1 file changed, 4 insertions(+), 6 deletions(-)

diff --git a/tools/process_stream.cpp b/tools/process_stream.cpp
index 521e3071..de7df04a 100644
--- a/tools/process_stream.cpp
+++ b/tools/process_stream.cpp
@@ -82,12 +82,10 @@ class MinCutSimple {
         return hash_val;
     }
 
-    // TODO: the first barrier here is to update edges to the next sketch without using the query() function
-    void pre_insert(GraphUpdate upd, node_id_t thr_id) {
-        for(unsigned int i=0;i<num_subgraphs;i++) {
-            k_edge_algs[i]->pre_insert(upd, thr_id);
-        }
-    }
+    
+    void pre_insert(GraphUpdate upd, node_id_t thr_id) { }
+
+    // TODO: Change the appl update batch function as opposed to change pre_insert
 
     void apply_update_batch(size_t thr_id, node_id_t src_vertex, const std::vector<node_id_t> &dst_vertices) {
         for(unsigned int i=0;i<num_subgraphs;i++) {