mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-31 06:33:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update Breadth_First_Search.py

Browse Source 
Fixed the fact that all nodes except source are marked as visited twice
This commit is contained in:
mounaim 2017-07-25 16:08:54 +01:00 committed by GitHub
parent 37705510e5
commit 9dcd981a57
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Graphs/Breadth_First_Search.py
View File

@ -15,10 +15,10 @@ class GRAPH:
def bfs(self,s): def bfs(self,s):
queue=[s] queue=[s]
self.visited[s]=1
while len(queue)!=0: while len(queue)!=0:
x=queue.pop(0) x=queue.pop(0)
print(x) print(x)
self.visited[x]=1
for i in range(0,self.nodes): for i in range(0,self.nodes):
if self.graph[x][i]==1 and self.visited[i]==0: if self.graph[x][i]==1 and self.visited[i]==0:
queue.append(i) queue.append(i)