shastar5
diff --git a/‎algorithm/graph_search/dfs/all_paths/data.js
+2-2 b/‎algorithm/graph_search/dfs/all_paths/data.js
+2-2
diff --git a/‎algorithm/graph_search/dfs/exploration/code.js
+12-7 b/‎algorithm/graph_search/dfs/exploration/code.js
+12-7
diff --git a/‎algorithm/graph_search/dfs/exploration/data.js
+5-5 b/‎algorithm/graph_search/dfs/exploration/data.js
+5-5
diff --git a/‎algorithm/graph_search/dfs/shortest_path/data.js
+2-2 b/‎algorithm/graph_search/dfs/shortest_path/data.js
+2-2
diff --git a/‎algorithm/graph_search/dfs/weighted_graph/data.js
+2-2 b/‎algorithm/graph_search/dfs/weighted_graph/data.js
+2-2
diff --git a/‎js/tracer_manager/util/refine_by_type.js
+12-1 b/‎js/tracer_manager/util/refine_by_type.js
+12-1
diff --git a/‎public/algorithm_visualizer.js
+16-2 b/‎public/algorithm_visualizer.js
+16-2
diff --git a/‎public/algorithm_visualizer.js.map
+1-1 b/‎public/algorithm_visualizer.js.map
+1-1
diff --git a/‎public/algorithm_visualizer.min.js
+1-1 b/‎public/algorithm_visualizer.min.js
+1-1
diff --git a/‎public/algorithm_visualizer.min.js.map
+1-1 b/‎public/algorithm_visualizer.min.js.map
+1-1
@@ -1,5 +1,5 @@
-var tracer = new DirectedGraphTracer();
+var tracer = new UndirectedGraphTracer();
 var logger = new LogTracer();
 tracer.attach(logger);
-var G = DirectedGraph.random(4, .75);
+var G = UndirectedGraph.random(5, 1);
 tracer._setData(G);
@@ -1,23 +1,28 @@
 function DFSExplore(graph, source) {
-  var stack = [[source, null]], visited = {};
+  var stack = [[source, null]], visited = [];
   var node, prev, i, temp;
+  for (i = 0; i < graph.length; i++) {
+    visited.push(false);
+  }
+  visitedTracer._setData(visited);
 
   while (stack.length > 0) {
     temp = stack.pop();
     node = temp [0];
     prev = temp [1];
 
-    if (!visited [node]) {
-      visited [node] = true;
+    if (!visited[node]) {
+      visited[node] = true;
+      visitedTracer._notify(node, visited[node]);
 
-      if (prev !== undefined && graph [node] [prev]) {
-        tracer._visit(node, prev)._wait();
+      if (prev !== undefined && graph[node][prev]) {
+        graphTracer._visit(node, prev)._wait();
       } else {
-        tracer._visit(node)._wait();
+        graphTracer._visit(node)._wait();
       }
 
       for (i = 0; i < graph.length; i++) {
-        if (graph [node] [i]) {
+        if (graph[node][i]) {
           stack.push([i, node]);
         }
       }
 
@@ -1,6 +1,6 @@
-var tracer = new UndirectedGraphTracer();
+var graphTracer = new UndirectedGraphTracer();
+var visitedTracer = new Array1DTracer('visited');
 var logger = new LogTracer();
-tracer.attach(logger);
-var G = UndirectedGraph.random(8, .2);
-
-tracer._setData(G);
+graphTracer.attach(logger);
+var G = UndirectedGraph.random(8, .3);
+graphTracer._setData(G);
@@ -1,5 +1,5 @@
-var tracer = new WeightedDirectedGraphTracer();
+var tracer = new WeightedUndirectedGraphTracer();
 var logger = new LogTracer();
 tracer.attach(logger);
-var G = WeightedDirectedGraph.random(5, 1, 1, 9);
+var G = WeightedUndirectedGraph.random(5, 1, 1, 9);
 tracer._setData(G);
@@ -1,5 +1,5 @@
-var tracer = new WeightedDirectedGraphTracer();
+var tracer = new WeightedUndirectedGraphTracer();
 var logger = new LogTracer();
 tracer.attach(logger);
-var G = WeightedDirectedGraph.random(4, .5);
+var G = WeightedUndirectedGraph.random(5, 1);
 tracer._setData(G);
@@ -1,5 +1,12 @@
 const refineByType = (item) => {
-  return typeof(item) === 'number' ? refineNumber(item) : refineString(item);
+  switch (typeof(item)) {
+    case 'number':
+      return refineNumber(item);
+    case 'boolean':
+      return refineBoolean(item);
+    default:
+      return refineString(item);
+  }
 };
 
 const refineString = (str) => {
@@ -10,4 +17,8 @@ const refineNumber = (num) => {
   return num === Infinity ? '∞' : num;
 };
 
+const refineBoolean = (bool) => {
+  return bool ? 'T' : 'F';
+};
+
 module.exports = refineByType;