Getting Started Olympiad C++BdOI Preliminary BdOI National

Dynamic Programming
Graph Traversal
- Depth-First Search (DFS)
- Breadth-First Search (BFS)
- Connected Components
- Topological Sort
- Euler Tour
Shortest Paths
- Dijkstra's Algorithm
- Floyd-Warshall Algorithm
Graph Data Structures
- Disjoint Set Union (DSU)
- Minimum Spanning Tree (MST)
Number Theory
Data Structures
- Segment Tree

IOI
BdOI National
Connected Components

Connected Components

Finding connected components in a graph.

Content for this lesson is yet to be written.

© 2025 OlyPrep contributors.