From 037560949d1028fb02e7ab4edb22e9fb0e5e72fb Mon Sep 17 00:00:00 2001
From: stefiosif <stef8iosif@gmail.com>
Date: Fri, 16 Sep 2022 15:17:32 +0300
Subject: [PATCH] Update misc

---
 ...reachability.h => dynamic_roditty_zwick.h} | 10 ++++-----
 benchmark/fully_dynamic_bench.cc              | 21 -------------------
 benchmark/{nanobench.h => nanobench.cc}       |  0
 graph/digraph.h                               |  2 ++
 test/fully_dynamic_test.cc                    | 14 -------------
 5 files changed, 7 insertions(+), 40 deletions(-)
 rename algorithm/{dynamic_reachability.h => dynamic_roditty_zwick.h} (56%)
 delete mode 100644 benchmark/fully_dynamic_bench.cc
 rename benchmark/{nanobench.h => nanobench.cc} (100%)
 delete mode 100644 test/fully_dynamic_test.cc

diff --git a/algorithm/dynamic_reachability.h b/algorithm/dynamic_roditty_zwick.h
similarity index 56%
rename from algorithm/dynamic_reachability.h
rename to algorithm/dynamic_roditty_zwick.h
index 9cb5ad4..f97b998 100644
--- a/algorithm/dynamic_reachability.h
+++ b/algorithm/dynamic_roditty_zwick.h
@@ -1,20 +1,20 @@
-#ifndef DYNAMIC_REACHABILITY_
-#define DYNAMIC_REACHABILITY_
+#ifndef DYNAMIC_RODITTY_ZWICK_H_
+#ifndef DYNAMIC_RODITTY_ZWICK_H_
 
 #include "algorithm/roditty_zwick.h"
 
 namespace algo {
 
 template<typename T>
-class DynamicReachability : public RodittyZwick {
-  ~DynamicReachability();
+class DynamicRodittyZwick : public RodittyZwick {
+  ~DynamicRodittyZwick();
 
   // Insert edge e(u,v) and maintain the transitive closure matrix
   virtual void insert(const T& u, const T& v) =0;
 };
 
 template<typename T>
-inline DynamicReachability<T>::~DynamicReachability() {
+inline DynamicRodittyZwick<T>::~DynamicRodittyZwick() {
 
 }
 
diff --git a/benchmark/fully_dynamic_bench.cc b/benchmark/fully_dynamic_bench.cc
deleted file mode 100644
index 27bd964..0000000
--- a/benchmark/fully_dynamic_bench.cc
+++ /dev/null
@@ -1,21 +0,0 @@
-#include <src/include/nanobench.h>
-#include <doctest/doctest.h>
-
-#include "algorithm/decremental_scc.h"
-#include "algorithm/italiano.h"
-#include "algorithm/frigioni.h"
-
-#include <fstream>
-
-using namespace graph;
-
-TEST_SUITE("Fully dynamic algorithms") {
-
-  TEST_CASE("Fully dynamic 1") {
-    std::ifstream infile("resources/data.txt");
-    std::uint16_t u, v;
-
-    //while (infile >> u >> v) {}
-  }
-
-}
\ No newline at end of file
diff --git a/benchmark/nanobench.h b/benchmark/nanobench.cc
similarity index 100%
rename from benchmark/nanobench.h
rename to benchmark/nanobench.cc
diff --git a/graph/digraph.h b/graph/digraph.h
index 4880d6f..37eaa6d 100644
--- a/graph/digraph.h
+++ b/graph/digraph.h
@@ -45,6 +45,8 @@ void Digraph<T>::insert(const T& u, const T& v) {
 template<typename T>
 void Digraph<T>::remove(const T& u, const T& v) {
   this->adjMatrix[u].erase(v);
+  //if (this->adjMatrix[u].size() == 0)
+  //  this->adjMatrix.erase(u);
 }
 
 template<typename T>
diff --git a/test/fully_dynamic_test.cc b/test/fully_dynamic_test.cc
deleted file mode 100644
index 37978ce..0000000
--- a/test/fully_dynamic_test.cc
+++ /dev/null
@@ -1,14 +0,0 @@
-#include <doctest/doctest.h>
-
-#include "algorithm/decremental_scc.h"
-#include "algorithm/frigioni.h"
-
-using namespace graph;
-
-TEST_SUITE("Fully dynamic algorithms") {
-
-  TEST_CASE("Fully dynamic 1") {
-  
-  }
-
-}
\ No newline at end of file