Update misc

algorithm/dynamic_roditty_zwick.h

@@ -1,20 +1,20 @@
-#ifndef DYNAMIC_REACHABILITY_
+#ifndef DYNAMIC_RODITTY_ZWICK_H_
-#define DYNAMIC_REACHABILITY_
+#ifndef DYNAMIC_RODITTY_ZWICK_H_
 
 #include "algorithm/roditty_zwick.h"
 
 namespace algo {
 
 template<typename T>
-class DynamicReachability : public RodittyZwick {
+class DynamicRodittyZwick : public RodittyZwick {
-  ~DynamicReachability();
+  ~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() {
 
 }
 

benchmark/fully_dynamic_bench.cc

@@ -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) {}
-  }
-
-}

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>

test/fully_dynamic_test.cc

@@ -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") {
-  
-  }
-
-}