CS_learn/tech-interview-handbook
1
0
Fork 0
mirror of https://github.com/yangshun/tech-interview-handbook.git synced 2026-02-03 10:34:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix small issue with bfs algorithm (#141)

Browse Source 
Algorithm performed a dfs rather than bfs because of the queue.pop() error on line 78. Updated to queue.popleft()
This commit is contained in:
Rafi Barash
2019-09-20 22:10:12 -05:00
committed by Louie Tan
parent 895d6f947c
commit c43337fdfb
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
contents/algorithms/graph.md
View File

@@ -75,7 +75,7 @@ def bfs(matrix):
def traverse(i, j):
queue = deque([(i, j)])
while queue:
curr_i, curr_j = queue.pop()
curr_i, curr_j = queue.popleft()
if (curr_i, curr_j) not in visited:
visited.add((curr_i, curr_j))
# Traverse neighbors.