Added oop recursive dfs in python thuva4#248 (thuva4#263)

robertpoziumschi · thuva4 · commit 166c2e084d16 · 2017-11-04T08:23:18.000+05:30
* test commit * Resolved thuva4#248
diff --git a/DepthFirstSearch/Python/dfs.py b/DepthFirstSearch/Python/dfs.py
@@ -0,0 +1,24 @@
+class Dfs:
+	def __init__(self, graph, nodes):
+		self.graph = graph
+		self.nodes = nodes
+		self.visited = [False for i in range(nodes)]
+
+	def dfs(self):
+		for node in range(self.nodes):
+			if not self.visited[node]:
+				self.visited[node] = True
+				self.visit(node)
+
+	def visit(self, node):
+		print node
+
+		for neighbour in graph[node]:
+			if not self.visited[neighbour]:
+				self.visited[neighbour] = True
+				self.visit(neighbour)
+
+# graph = [[1,3], [2], [], [2], [7], [6,7], [7], [], []]
+# nodes = 9
+# makeDFS = Dfs(graph, nodes)
+# makeDFS.dfs()
diff --git a/DepthFirstSearch/Python/dfs_oop_rec.py b/DepthFirstSearch/Python/dfs_oop_rec.py
@@ -0,0 +1,24 @@
+class Dfs:
+	def __init__(self, graph, nodes):
+		self.graph = graph
+		self.nodes = nodes
+		self.visited = [False for i in range(nodes)]
+
+	def dfs(self):
+		for node in range(self.nodes):
+			if not self.visited[node]:
+				self.visited[node] = True
+				self.visit(node)
+
+	def visit(self, node):
+		print node
+
+		for neighbour in graph[node]:
+			if not self.visited[neighbour]:
+				self.visited[neighbour] = True
+				self.visit(neighbour)
+
+# graph = [[1,3], [2], [], [2], [7], [6,7], [7], [], []]
+# nodes = 9
+# makeDFS = Dfs(graph, nodes)
+# makeDFS.dfs()
