Graphs 3
Lecture date: Friday, October 04, 2019Synopsis
This lecture will cover cycle detection, bipartite graphs, cut edges and nodes, and strongly connected components.
Recommended Reading
- Competitive Programming 3, Section 4.2
This lecture will cover cycle detection, bipartite graphs, cut edges and nodes, and strongly connected components.