Graphs 2
Lecture date: Wednesday, October 02, 2019Synopsis
We will talk about DFS and BFS, and some problems you can solve with it: - Connected Components - Flood Fill - Topological Sort
Recommended Reading
- Competitive Programming 3, 4.1 – 4.2.5
We will talk about DFS and BFS, and some problems you can solve with it: - Connected Components - Flood Fill - Topological Sort