1.2 KiB
1.2 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. |
Note that this is not required for silver.
Tutorial
Problems
- USACO
- Monsters
- Cow Navigation
- Dream
- bad problem ...
- Lasers
- Visit FJ
- Other