do these now

Author: lrvideckis

library/graphs/bridges_cuts/block_vertex_tree.hpp

@@ -21,8 +21,7 @@
 //! [n, n + num_bccs) are BCC nodes
 //! @time O(n + m)
 //! @time O(n)
-template<class G>
-vector<vi> block_vertex_tree(const G& adj, int num_bccs,
+vector<vi> block_vertex_tree(const auto& adj, int num_bccs,
   const vi& bcc_id) {
   int n = sz(adj);
   vector<vi> bvt(n + num_bccs);

library/graphs/bridges_cuts/bridge_tree.hpp

@@ -12,8 +12,7 @@
 //! @endcode
 //! @time O(n + m)
 //! @space O(n)
-template<class G>
-vector<vi> bridge_tree(const G& adj, int num_ccs,
+vector<vi> bridge_tree(const auto& adj, int num_ccs,
   const vi& br_id, const vi& is_br) {
   vector<vi> tree(num_ccs);
   rep(i, 0, sz(adj)) for (auto [u, e_id] : adj[i]) if (

library/graphs/bridges_cuts/bridges.hpp

@@ -19,7 +19,7 @@
 //! br_id[v] = id, 0<=id<num_ccs
 //! @time O(n + m)
 //! @space O(n + m)
-template<class G> auto bridges(const G& adj, int m) {
+auto bridges(const auto& adj, int m) {
   int n = sz(adj), num_ccs = 0, timer = 0;
   vi br_id(n, -1), is_br(m), tin(n), st;
   auto dfs = [&](auto&& self, int v, int p_id) -> int {

library/graphs/bridges_cuts/cuts.hpp

@@ -20,7 +20,7 @@
 //! bcc_id[edge id] = id, 0<=id<num_bccs
 //! @time O(n + m)
 //! @space O(n + m)
-template<class G> auto cuts(const G& adj, int m) {
+auto cuts(const auto& adj, int m) {
   int n = sz(adj), num_bccs = 0, timer = 0;
   vi bcc_id(m, -1), is_cut(n), tin(n), st;
   auto dfs = [&](auto&& self, int v, int p_id) -> int {