diff --git a/main.cpp b/main.cpp
index 2e90faefbf22d1f937db5ddc6ef63b13330619b6..4cb1a411440a3bca4ac7e6004ca51cc7d109f205 100644
--- a/main.cpp
+++ b/main.cpp
@@ -1,7 +1,7 @@
-#include <iostream>
-#include <iterator>
-#include <memory>
-#include <vector>
+//#include <iostream>
+//#include <iterator>
+//#include <memory>
+//#include <vector>
 //#include <ctime>
 /*
 namespace recursive_storage{
@@ -369,24 +369,24 @@ public:
 template<class T>
 int graph<T>::node::_id=0;
 }*/
-
+/*
 void test1(int num)
 {
-  //time_t start,end;
+  time_t start,end;
   std::cout<<"test1 : create "<<num<<" 1 node graph"<<std::endl;
-  //start=time(0);
+  start=time(0);
   {
     for(size_t i=0;i<num;i++)
     {
-      //local_storage::graph<int> graph{};
-      //graph.add_node(6);
+      local_storage::graph<int> graph{};
+      graph.add_node(6);
     }
   }
-  //end=time(0);
-  std::cout<<"local_storage: ";
-            /*<<localtime(&end)->tm_min*60+localtime(&end)->tm_sec-
+  end=time(0);
+  std::cout<<"local_storage: "
+            <<localtime(&end)->tm_min*60+localtime(&end)->tm_sec-
             localtime(&start)->tm_min*60-localtime(&start)->tm_sec<<"s"<<std::endl;
-  /*start=time(0);
+  start=time(0);
   {
     for(size_t i=0;i<num;i++)
     {
@@ -396,30 +396,30 @@ void test1(int num)
   end=time(0);
   std::cout<<"recursive_storage: "
             <<localtime(&end)->tm_min*60+localtime(&end)->tm_sec-
-            localtime(&start)->tm_min*60-localtime(&start)->tm_sec<<"s"<<std::endl;*/
+            localtime(&start)->tm_min*60-localtime(&start)->tm_sec<<"s"<<std::endl;
 }
 
 void test2(int num)
 {
-  //time_t start,end;
+  time_t start,end;
   std::cout<<"test2 : create "<<num<<" 5 node full connected graph"<<std::endl;
-  //start=time(0);
+  start=time(0);
   {
     for(size_t i=0;i<num;i++)
     {
-      /*local_storage::graph<int> graph{};
+      local_storage::graph<int> graph{};
       for(size_t j=0;j<5;j++)
         graph.add_node(6);
       for(size_t j=0;j<5;j++)
         for(size_t l=0;l<5;l++)
-          graph.connect(graph[j],graph[l]);*/
+          graph.connect(graph[j],graph[l]);
     }
   }
-  //end=time(0);
-  std::cout<<"local_storage: ";
-          /*  <<localtime(&end)->tm_min*60+localtime(&end)->tm_sec-
+  end=time(0);
+  std::cout<<"local_storage: "
+            <<localtime(&end)->tm_min*60+localtime(&end)->tm_sec-
             localtime(&start)->tm_min*60-localtime(&start)->tm_sec<<"s"<<std::endl;
-  /*start=time(0);
+  start=time(0);
   {
     for(size_t i=0;i<num;i++)
     {
@@ -434,18 +434,18 @@ void test2(int num)
   end=time(0);
   std::cout<<"recursive_storage: "
             <<localtime(&end)->tm_min*60+localtime(&end)->tm_sec-
-            localtime(&start)->tm_min*60-localtime(&start)->tm_sec<<"s"<<std::endl;*/
+            localtime(&start)->tm_min*60-localtime(&start)->tm_sec<<"s"<<std::endl;
 }
 
 void test3(int num)
 {
-  //time_t start,end;
+  time_t start,end;
   std::cout<<"test3 : create "<<num<<" 30 node line graph, search for the deepest and delete it."<<std::endl;
-  //start=time(0);
+  start=time(0);
   {
     for(size_t i=0;i<num;i++)
     {
-      /*local_storage::graph<int> graph{};
+      local_storage::graph<int> graph{};
       for(size_t j=0;j<29;j++)
         graph.add_node(6);
       graph.add_node(30);
@@ -453,14 +453,14 @@ void test3(int num)
         graph.connect(graph[j-1],graph[j]);
       local_storage::graph<int>::node* target;
       graph.run([&target](local_storage::graph<int>::node& node){if(node.data()==30) {target=&node;return true;}return false;});
-      graph.erase(*target);*/
+      graph.erase(*target);
     }
   }
-  //end=time(0);
-  std::cout<<"local_storage: ";
-           /* <<localtime(&end)->tm_min*60+localtime(&end)->tm_sec-
+  end=time(0);
+  std::cout<<"local_storage: "
+           <<localtime(&end)->tm_min*60+localtime(&end)->tm_sec-
             localtime(&start)->tm_min*60-localtime(&start)->tm_sec<<"s"<<std::endl;
-  /*start=time(0);
+  start=time(0);
   {
     for(size_t i=0;i<num;i++)
     {
@@ -475,13 +475,13 @@ void test3(int num)
   end=time(0);
   std::cout<<"recursive_storage: "
             <<localtime(&end)->tm_min*60+localtime(&end)->tm_sec-
-            localtime(&start)->tm_min*60-localtime(&start)->tm_sec<<"s"<<std::endl;*/
-}
+            localtime(&start)->tm_min*60-localtime(&start)->tm_sec<<"s"<<std::endl;
+}*/
 
 int main()
 {
-  test1(1000000);
-  test2(100000);
-  test3(100000);
+  //test1(1000000);
+  //test2(100000);
+  //test3(100000);
   return 0;
-}
+}
\ No newline at end of file