CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-24 10:33:34 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add captions for all the animations.

Browse Source
This commit is contained in:
krahets
2023-02-26 19:22:46 +08:00
parent 7aa44d212c
commit 23cda5e225
13 changed files with 20 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
docs/chapter_graph/graph_traversal.md
View File

@@ -87,7 +87,7 @@ BFS 常借助「队列」来实现。队列具有“先入先出”的性质，
代码相对抽象，建议对照以下动画图示来加深理解。
=== "<1>"
![graph_bfs_step1](graph_traversal.assets/graph_bfs_step1.png)
![图的广度优先遍历步骤](graph_traversal.assets/graph_bfs_step1.png)
=== "<2>"
![graph_bfs_step2](graph_traversal.assets/graph_bfs_step2.png)
@@ -227,7 +227,7 @@ BFS 常借助「队列」来实现。队列具有“先入先出”的性质，
为了加深理解，请你将图示与代码结合起来，在脑中（或者用笔画下来）模拟整个 DFS 过程，包括每个递归方法何时开启、何时返回。
=== "<1>"
![graph_dfs_step1](graph_traversal.assets/graph_dfs_step1.png)
![图的深度优先遍历步骤](graph_traversal.assets/graph_dfs_step1.png)
=== "<2>"
![graph_dfs_step2](graph_traversal.assets/graph_dfs_step2.png)