algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update data_and_memory.md and graph_traversal.md

Browse Source
This commit is contained in:
krahets
2023-02-24 11:42:59 +08:00
parent 107110d2d2
commit 4a0c4eea69
2 changed files with 5 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
docs/chapter_graph/graph_traversal.md
View File

@@ -125,7 +125,7 @@ BFS 常借助「队列」来实现。队列具有“先入先出”的性质，
!!! question "广度优先遍历的序列是否唯一？"
不唯一。广度优先遍历只要求“由近及远”，而相同距离的多个顶点的遍历顺序允许任意被打乱。以上图为例，顶点 $1$ , $3$ 的访问顺序可以交换、顶点 $2$ , $4$ , $6$ 的访问顺序也可以任意交换、以此类推……
不唯一。广度优先遍历只要求“由近及远”，**而多个相同距离的顶点的遍历顺序允许被任意打乱**。以上图为例，顶点 $1$ , $3$ 的访问顺序可以交换、顶点 $2$ , $4$ , $6$ 的访问顺序也可以任意交换、以此类推……
### 复杂度分析