We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 9cd9141 commit 5af9332Copy full SHA for 5af9332
lib/cpalgo/ds/README.md
@@ -6,6 +6,7 @@ a.k.a Union Find Tree
6
7
### Challenges
8
- [道路の老朽化対策について - AtCoder ABC040D](https://atcoder.jp/contests/abc040/tasks/abc040_d)
9
+- [D - Friend Suggestions](https://atcoder.jp/contests/abc157/tasks/abc157_d)
10
11
## Binary Indexed Tree
12
lib/cpalgo/graph/README.md
@@ -29,7 +29,14 @@ We can find all articulation points of a given graph in `O(V + E)`.
29
- [AtCoder | E - League](https://atcoder.jp/contests/abc139/tasks/abc139_e)
30
31
32
-## Strongly Connected Components
+## Connected Components (Undirected Graph)
33
+🚧
34
+
35
+### Challenges
36
37
38
39
+## Strongly Connected Components (Directed Graph)
40
🚧
41
42
0 commit comments