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

contents(algo): fix typo in algorithm/graph content (#594)

Browse Source
This commit is contained in:
ZongQi Ooi
2023-07-04 16:20:56 +08:00
committed by GitHub
parent e3a414e3ab
commit c3a287dc17
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
apps/website/contents/algorithms/graph.md
View File

@@ -117,7 +117,7 @@ def dfs(matrix):
Breadth-first search is a graph traversal algorithm which starts at a node and explores all nodes at the present depth, before moving on to the nodes at the next depth level. A [queue](./queue.md) is usually used to keep track of the nodes that were encountered but not yet explored.
A similar template for doing breadth-first searches on the matrix goes like this. It is important to use double-ended queues and not arrays/Python lists as enqueuing for double-ended queues is O(1) but it's O(n) for arrays.
A similar template for doing breadth-first searches on the matrix goes like this. It is important to use double-ended queues and not arrays/Python lists as dequeuing for double-ended queues is O(1) but it's O(n) for arrays.
```py
from collections import deque