1.3 KiB
1.3 KiB
id | title | author | prerequisites | description | |
---|---|---|---|---|---|
bfs | Breadth First Search | Benjamin Qi |
|
Traversing a graph in a way such that vertices closer to the starting vertex are processed first. |
Tutorial
Problems
- USACO Gold
- Monsters
- Cow Navigation
- Dream
- lots of casework
- Lasers
- Visit FJ
- Other