From fcecd4d8b0db1dcc421afe23e4e93703a75da3c9 Mon Sep 17 00:00:00 2001 From: lierluis Date: Thu, 5 Oct 2017 01:13:46 -0700 Subject: [PATCH 1/3] Remove unnecessary lines --- data_structures/Graph/Breadth_First_Search.py | 13 ------------- 1 file changed, 13 deletions(-) diff --git a/data_structures/Graph/Breadth_First_Search.py b/data_structures/Graph/Breadth_First_Search.py index 1a3fdfd4d90f..7c9d4e998dee 100644 --- a/data_structures/Graph/Breadth_First_Search.py +++ b/data_structures/Graph/Breadth_First_Search.py @@ -29,19 +29,6 @@ def bfs(self,v): 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): From ca09b78a8f421d94410342cb0c49f2888ae21fbe Mon Sep 17 00:00:00 2001 From: lierluis Date: Thu, 5 Oct 2017 01:15:17 -0700 Subject: [PATCH 2/3] Make BFS file Python3 compatible --- data_structures/Graph/Breadth_First_Search.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/data_structures/Graph/Breadth_First_Search.py b/data_structures/Graph/Breadth_First_Search.py index 7c9d4e998dee..97a51c6b16dd 100644 --- a/data_structures/Graph/Breadth_First_Search.py +++ b/data_structures/Graph/Breadth_First_Search.py @@ -29,7 +29,7 @@ def bfs(self,v): print('%d visited' % (u +1)) queue.pop(0) - print self.graph + print(self.graph) def add_edge(self, i, j): self.graph[i][j]=1 @@ -51,7 +51,7 @@ def bfs(self,s): 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()) + u,v=map(int, input().split()) g.add_edge(u,v) s=int(input("Enter the source node :")) g.bfs(s) From 9264ba379f5c8aacd46a6833ebf923145040ef66 Mon Sep 17 00:00:00 2001 From: lierluis Date: Thu, 5 Oct 2017 01:16:27 -0700 Subject: [PATCH 3/3] Make DFS file Python3 compatible --- data_structures/Graph/Deep_First_Search.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/data_structures/Graph/Deep_First_Search.py b/data_structures/Graph/Deep_First_Search.py index 656ddfbafd34..b1160eb33f3e 100644 --- a/data_structures/Graph/Deep_First_Search.py +++ b/data_structures/Graph/Deep_First_Search.py @@ -7,7 +7,7 @@ def __init__(self, nodes): def show(self): - print self.graph + print(self.graph) def add_edge(self, i, j): self.graph[i][j]=1 @@ -26,7 +26,7 @@ def dfs(self,s): 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()) + u,v=map(int, input().split()) g.add_edge(u,v) s=int(input("Enter the source node :")) g.dfs(s)