---
id: bfs
title: "Breadth First Search"
author: Benjamin Qi
prerequisites:
- Silver - Depth First Search
description: Traversing a graph in a way such that vertices closer to the starting vertex are processed first.
Note that this is **not** required for silver.
- [CSES Message Route](https://cses.fi/problemset/task/1667)
### Tutorial
- CSES 12.2
- [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
- USACO
- [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)
- bad problem ...
- [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)
