algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 15:45:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #2281 from Youngkkkk/master

Browse Source 
错别字修改：“在”->“再”
This commit is contained in:
程序员Carl
2023-09-28 09:28:00 +08:00
committed by GitHub
parent 0e51e5b6aa f7cb043d2d
commit 39a2b2e7c4
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/图论广搜理论基础.md
View File

@ -9,7 +9,7 @@
在[深度优先搜索](https://programmercarl.com/图论深搜理论基础.html)的讲解中，我们就讲过深度优先搜索和广度优先搜索的区别。
广搜（bfs）是一圈一圈的搜索过程，和深搜（dfs）是一条路跑到黑然后在回溯。
广搜（bfs）是一圈一圈的搜索过程，和深搜（dfs）是一条路跑到黑然后再回溯。
## 广搜的使用场景