🧑‍💻 improves biconnected compoments implementation

README.md

@@ -58,6 +58,7 @@ Here you will find implementation of algorithms and data structures used in comp
     - [bellman ford](/algorithms/graphs/bellman-ford.cpp)
     - [bellman ford (find negative cycle)](/algorithms/graphs/bellman-ford-(find-negative-cycle).cpp)
     - [bfs 01](/algorithms/graphs/bfs-01.cpp)
+    - [biconnected components](/algorithms/graphs/biconnected-components.cpp)
     - [binary lifting](/algorithms/graphs/binary-lifting.cpp)
     - [block cut tree](/algorithms/graphs/block-cut-tree.cpp)
     - [check bipartite](/algorithms/graphs/check-bipartite.cpp)
@@ -182,6 +183,7 @@ Here you will find implementation of algorithms and data structures used in comp
 - [Macacário](https://github.com/splucs/Competitive-Programming)
 - [Algorithms for Competitive Programming](https://cp-algorithms.com/)
 - [KACTL ICPC Code Library](https://github.com/kth-competitive-programming/kactl)
+- [SSRS lib](https://ssrs-cp.github.io/cp_library/)
 - [Neps Academy](https://neps.academy/br/courses)
 - [USACO Guide](https://usaco.guide/dashboard/)
 - [IME algoritmos](https://www.ime.usp.br/~pf/algoritmos/idx.html)