2020-06-05 00:21:03 +00:00
|
|
|
---
|
2020-06-15 23:19:07 +00:00
|
|
|
id: bfs
|
2020-06-05 00:21:03 +00:00
|
|
|
title: "Breadth First Search"
|
|
|
|
|
author: Benjamin Qi
|
|
|
|
|
prerequisites:
|
2020-06-22 20:51:12 +00:00
|
|
|
- Silver - Depth First Search
|
2020-06-22 19:59:16 +00:00
|
|
|
description: Traversing a graph in a way such that vertices closer to the starting vertex are processed first.
|
2020-06-05 00:21:03 +00:00
|
|
|
---
|
|
|
|
|
|
|
|
|
|
- [CSES Message Route](https://cses.fi/problemset/task/1667)
|
|
|
|
|
|
2020-06-23 17:27:41 +00:00
|
|
|
<info-block title="Pro Tip">
|
|
|
|
|
No silver problem should require BFS rather than DFS, but it's still good to know at this level.
|
|
|
|
|
</info-block>
|
|
|
|
|
|
2020-06-05 00:21:03 +00:00
|
|
|
### Tutorial
|
|
|
|
|
|
2020-06-23 01:00:35 +00:00
|
|
|
- CPH 12.2
|
|
|
|
|
- [PAPS 12.1](https://www.csc.kth.se/~jsannemo/slask/main.pdf)
|
2020-06-05 00:21:03 +00:00
|
|
|
- [CSAcademy BFS](https://csacademy.com/lesson/breadth_first_search)
|
|
|
|
|
- [cp-algo BFS](https://cp-algorithms.com/graph/breadth-first-search.html)
|
|
|
|
|
- [cp-algo 0/1 BFS](https://cp-algorithms.com/graph/01_bfs.html)
|
|
|
|
|
- [KhanAcademy BFS](https://www.khanacademy.org/computing/computer-science/algorithms/breadth-first-search/a/breadth-first-search-and-its-uses)
|
|
|
|
|
|
|
|
|
|
### Problems
|
|
|
|
|
|
2020-06-23 01:00:35 +00:00
|
|
|
- USACO Gold
|
2020-06-16 17:09:59 +00:00
|
|
|
- [Monsters](https://cses.fi/problemset/task/1194)
|
|
|
|
|
- [Cow Navigation](http://www.usaco.org/index.php?page=viewproblem2&cpid=695)
|
|
|
|
|
- [Dream](http://www.usaco.org/index.php?page=viewproblem2&cpid=575)
|
2020-06-23 17:27:41 +00:00
|
|
|
- lots of casework
|
2020-06-16 17:09:59 +00:00
|
|
|
- [Lasers](http://www.usaco.org/index.php?page=viewproblem2&cpid=671)
|
|
|
|
|
- [Visit FJ](http://www.usaco.org/index.php?page=viewproblem2&cpid=717)
|
|
|
|
|
- Other
|
|
|
|
|
- [CSAcademy BFS-DFS](https://csacademy.com/contest/round-41/task/bfs-dfs/) [](50)
|
