mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-03-15 02:59:50 +00:00
Code Issues Packages Projects Releases Wiki Activity

Make BFS file Python3 compatible

Browse Source
This commit is contained in:
lierluis 2017-10-05 01:15:17 -07:00
parent fcecd4d8b0
commit ca09b78a8f
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
data_structures/Graph/Breadth_First_Search.py
View File

@ -29,7 +29,7 @@ class GRAPH:
print('%d visited' % (u +1)) print('%d visited' % (u +1))
queue.pop(0) queue.pop(0)
print self.graph print(self.graph)
def add_edge(self, i, j): def add_edge(self, i, j):
self.graph[i][j]=1 self.graph[i][j]=1
@ -51,7 +51,7 @@ g=GRAPH(n)
e=int(input("Enter the no of edges : ")) e=int(input("Enter the no of edges : "))
print("Enter the edges (u v)") print("Enter the edges (u v)")
for i in range(0,e): for i in range(0,e):
u,v=map(int, raw_input().split()) u,v=map(int, input().split())
g.add_edge(u,v) g.add_edge(u,v)
s=int(input("Enter the source node :")) s=int(input("Enter the source node :"))
g.bfs(s) g.bfs(s)