From 974acef310bc70dc634b651d9e8ea502ae09ad04 Mon Sep 17 00:00:00 2001
From: Sachin Arora <sachinarora.707@gmail.com>
Date: Fri, 13 Oct 2017 21:03:16 +0530
Subject: [PATCH] Deleting duplicate BFS and DFS files. (#164)

* Deleting duplicate file BFS.

* deleting duplicate file DFS.

* Rename P01_BreadthFirstSearch.py to BreadthFirstSearch.py

* Rename P02_DepthFirstSearch.py to DepthFirstSearch.py
---
 ...thFirstSearch.py => BreadthFirstSearch.py} |  0
 data_structures/Graph/Breadth_First_Search.py | 72 -------------------
 data_structures/Graph/Deep_First_Search.py    | 32 ---------
 ...epthFirstSearch.py => DepthFirstSearch.py} |  0
 4 files changed, 104 deletions(-)
 rename data_structures/Graph/{P01_BreadthFirstSearch.py => BreadthFirstSearch.py} (100%)
 delete mode 100644 data_structures/Graph/Breadth_First_Search.py
 delete mode 100644 data_structures/Graph/Deep_First_Search.py
 rename data_structures/Graph/{P02_DepthFirstSearch.py => DepthFirstSearch.py} (100%)

diff --git a/data_structures/Graph/P01_BreadthFirstSearch.py b/data_structures/Graph/BreadthFirstSearch.py
similarity index 100%
rename from data_structures/Graph/P01_BreadthFirstSearch.py
rename to data_structures/Graph/BreadthFirstSearch.py
diff --git a/data_structures/Graph/Breadth_First_Search.py b/data_structures/Graph/Breadth_First_Search.py
deleted file mode 100644
index 92a6e819b..000000000
--- a/data_structures/Graph/Breadth_First_Search.py
+++ /dev/null
@@ -1,72 +0,0 @@
-class GRAPH:
-    """docstring for GRAPH"""
-    def __init__(self, nodes):
-        self.nodes = nodes
-        self.graph = [[0]*nodes for i in range (nodes)]
-        self.visited = [0]*nodes
-
-
-    def show(self):
-
-        for i in self.graph:
-            for j in i:
-                print(j, end=' ')
-            print(' ')
-    def bfs(self,v):
-
-        visited = [False]*self.vertex
-        visited[v - 1] = True
-        print('%d visited' % (v))
-
-        queue = [v - 1]
-        while len(queue) > 0:
-            v = queue[0]
-            for u in range(self.vertex):
-                if self.graph[v][u] == 1:
-                    if visited[u] is False:
-                        visited[u] = True
-                        queue.append(u)
-                        print('%d visited' % (u +1))
-            queue.pop(0)
-
-g = Graph(10)
-
-g.add_edge(1,2)
-g.add_edge(1,3)
-g.add_edge(1,4)
-g.add_edge(2,5)
-g.add_edge(3,6)
-g.add_edge(3,7)
-g.add_edge(4,8)
-g.add_edge(5,9)
-g.add_edge(6,10)
-g.bfs(4)
-
-print(self.graph)
-
-    def add_edge(self, i, j):
-        self.graph[i][j]=1
-        self.graph[j][i]=1
-
-    def bfs(self, s):
-        queue = [s]
-        self.visited[s] = 1
-        while len(queue)!= 0:
-            x = queue.pop(0)
-            print(x)
-            for i in range(0, self.nodes):
-                if self.graph[x][i] == 1 and self.visited[i] == 0:
-                    queue.append(i)     
-                    self.visited[i] = 1
-
-n = int(input("Enter the number of Nodes : "))
-g = GRAPH(n)
-e = int(input("Enter the no of edges : "))
-print("Enter the edges (u v)")
-
-for i in range(0, e):
-    u ,v = map(int, raw_input().split())
-    g.add_edge(u, v)
-
-s = int(input("Enter the source node :"))
-g.bfs(s)
diff --git a/data_structures/Graph/Deep_First_Search.py b/data_structures/Graph/Deep_First_Search.py
deleted file mode 100644
index 656ddfbaf..000000000
--- a/data_structures/Graph/Deep_First_Search.py
+++ /dev/null
@@ -1,32 +0,0 @@
-class GRAPH:
-    """docstring for GRAPH"""
-    def __init__(self, nodes):
-        self.nodes=nodes
-        self.graph=[[0]*nodes for i in range (nodes)]
-        self.visited=[0]*nodes
-
-
-    def show(self):
-        print self.graph
-
-    def add_edge(self, i, j):
-        self.graph[i][j]=1
-        self.graph[j][i]=1
-
-    def dfs(self,s):
-        self.visited[s]=1
-        print(s)
-        for i in range(0,self.nodes):
-            if self.visited[i]==0 and self.graph[s][i]==1:
-                self.dfs(i)
-            
-
-n=int(input("Enter the number of Nodes : "))
-g=GRAPH(n)
-e=int(input("Enter the no of edges : "))
-print("Enter the edges (u v)")
-for i in range(0,e):
-    u,v=map(int, raw_input().split())
-    g.add_edge(u,v)
-s=int(input("Enter the source node :"))
-g.dfs(s)
diff --git a/data_structures/Graph/P02_DepthFirstSearch.py b/data_structures/Graph/DepthFirstSearch.py
similarity index 100%
rename from data_structures/Graph/P02_DepthFirstSearch.py
rename to data_structures/Graph/DepthFirstSearch.py