diff --git a/main.cpp b/main.cpp
index b1d3007063fb79e3fb46a7a2d7375b77e916a30b..2e90faefbf22d1f937db5ddc6ef63b13330619b6 100644
--- a/main.cpp
+++ b/main.cpp
@@ -2,7 +2,7 @@
 #include <iterator>
 #include <memory>
 #include <vector>
-#include <ctime>
+//#include <ctime>
 /*
 namespace recursive_storage{
 template<class T>
@@ -372,9 +372,9 @@ 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++)
     {
@@ -382,9 +382,9 @@ void test1(int num)
       //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);
   {
@@ -401,9 +401,9 @@ void test1(int num)
 
 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++)
     {
@@ -415,9 +415,9 @@ void test2(int num)
           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);
   {
@@ -439,9 +439,9 @@ void test2(int num)
 
 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++)
     {
@@ -456,9 +456,9 @@ void test3(int num)
       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);
   {