From 90135eba04c360e9709386d57eea363106dabd9f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=82=B9=E6=99=93=E8=88=AA?= <1210603696@qq.com>
Date: Thu, 12 Feb 2015 16:13:46 +0800
Subject: [PATCH] =?UTF-8?q?=E5=88=A0=E9=99=A4=E5=A4=9A=E4=BD=99=E6=B3=A8?=
 =?UTF-8?q?=E9=87=8A?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 TinySTL/Detail/Graph.impl.h | 15 ---------------
 1 file changed, 15 deletions(-)

diff --git a/TinySTL/Detail/Graph.impl.h b/TinySTL/Detail/Graph.impl.h
index 0703d6b..42b9f09 100644
--- a/TinySTL/Detail/Graph.impl.h
+++ b/TinySTL/Detail/Graph.impl.h
@@ -119,21 +119,6 @@ namespace TinySTL{
 			node_type start = (get_node(index));
 			Unordered_set<Index, std::hash<Index>, EqualFunc> visited(7);
 			_BFS(start, func, visited);
-			//auto nodes = adjacent_nodes(start->first);
-			//func(*start);
-			//visited.insert(start->first);
-			//do{
-			//	nodes_set_type temp;
-			//	for (auto it = nodes.begin(); it != nodes.end(); ++it){
-			//		if (visited.count(it->first) == 0){//has not visited
-			//			func(*it);
-			//			visited.insert(it->first);
-			//			auto s = adjacent_nodes(it->first);						
-			//			temp.insert(temp.end(), s.begin(), s.end());
-			//		}
-			//	}
-			//	nodes = temp;
-			//} while (!nodes.empty());
 		}
 		template<class Index, class Value, class EqualFunc>
 		string graph<Index, Value, EqualFunc>::to_string(){