Merge pull request algorithm-visualizer#52 from duaraghav8/master

Added DFS Exploration (determine connectedness of Graph)

Author: Raghav Dua

algorithm/graph_search/dfs/desc.json

@@ -24,6 +24,7 @@
     "tree": "Searching a tree",
     "all_paths": "Going through all possible paths without making any circuit",
     "weighted_graph": "DFS of Weighted Graph",
-    "shortest_path": "Finding the shortest path"
+    "shortest_path": "Finding the shortest path",
+    "exploration": "Explore an undirected graph to see if it is connected"
   }
 }

algorithm/graph_search/dfs/exploration/code.js

@@ -0,0 +1,35 @@
+function DFSExplore (graph, source) {
+	var stack = [ [source, null] ], visited = {};
+	var node, prev, i, temp;
+
+	while (stack.length > 0) {
+		temp = stack.pop ();
+		node = temp [0];
+		prev = temp [1];
+
+		if (!visited [node]) {
+			visited [node] = true;
+			logger._print (node);
+
+			if (prev !== undefined && graph [node] [prev]) { tracer._visit (node, prev)._wait (200); console.log ('tracer ' + prev + ', ' + node); }
+			else { tracer._visit (node)._wait (200); console.log ('tracer ' + node); }
+
+			for (i = 0; i < graph.length; i++) {
+				if (graph [node] [i]) {
+					stack.push ([i, node]);
+				}
+			}
+		}
+	}
+
+	return visited;
+}
+
+
+var visited = DFSExplore (G, 0);
+if (G.length === Object.keys (visited).length) {
+	logger._print ('The Graph is CONNECTED');
+}
+else {
+	logger._print ('The Graph is NOT CONNECTED');
+}

algorithm/graph_search/dfs/exploration/data.js

@@ -0,0 +1,12 @@
+var tracer = new UndirectedGraphTracer ();
+var logger = new LogTracer ();
+var G = [
+	[0,1,0,0,0,0],
+	[1,0,0,1,1,0],
+	[0,0,0,1,0,0],
+	[0,1,1,0,1,1],
+	[0,1,0,1,0,0],
+	[0,0,0,1,0,0]
+];
+
+tracer._setData (G);