Merge pull request TheAlgorithms#98 from moun3imy/patch-1

Update Breadth_First_Search.py

Author: 0oo0

Graphs/Breadth_First_Search.py

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