switch another place

Author: lrvideckis

library/trees/ladder_decomposition/ladder_decomposition.hpp

@@ -15,7 +15,7 @@ struct ladder {
   //! @param adj forest (rooted or unrooted)
   //! @time O(n log n)
   //! @space O(n log n) for b_tbl. Everything else is O(n)
-  ladder(const vector<vi>& adj):
+  ladder(const auto& adj):
     n(sz(adj)), d(n), p(n, -1), dl(n), idx_l(n) {
     auto dfs = [&](auto&& self, int v) -> void {
       dl[v] = v;