add templatized versions of graphs

Author: lrvideckis

library/graphs/bridges_cuts/block_vertex_tree.hpp

@@ -4,6 +4,9 @@
 //!   vector<vector<pii>> adj(n);
 //!   cuts cc(adj, m);
 //!   vector<vi> bvt = block_vertex_tree(adj, cc);
+//!   vector<basic_string<array<int, 2>>> adj1(n);
+//!   cuts cc1(adj1, m);
+//!   vector<vi> bvt1 = block_vertex_tree(adj1, cc1);
 //!   //to loop over each unique bcc containing a node u:
 //!   for (int bccid : bvt[v]) {
 //!     bccid -= n;
@@ -15,8 +18,9 @@
 //! [n, n + num_bccs) are BCC nodes
 //! @time O(n + m)
 //! @time O(n)
-vector<vi> block_vertex_tree(
-  const vector<vector<pii>>& adj, const cuts& cc) {
+template<class G>
+vector<vi> block_vertex_tree(const G& adj,
+  const cuts& cc) {
   int n = sz(adj);
   vector<vi> bvt(n + cc.num_bccs);
   vector<bool> vis(cc.num_bccs);

library/graphs/bridges_cuts/bridge_tree.hpp

@@ -4,6 +4,9 @@
 //!   vector<vector<pii>> adj(n);
 //!   bridges br(adj, m);
 //!   vector<vi> bt = bridge_tree(adj, br);
+//!   vector<basic_string<array<int, 2>>> adj1(n);
+//!   bridges br1(adj1, m);
+//!   vector<vi> bt1 = bridge_tree(adj1, br1);
 //! @endcode
 //! @time O(n + m)
 //! @space O(n)

library/graphs/bridges_cuts/bridges.hpp

@@ -10,16 +10,19 @@
 //!     adj[v].emplace_back(u, i);
 //!   }
 //!   auto [num_ccs, is_bridge, br_id] = bridges(adj, m);
+//!   vector<basic_string<array<int,2>>> adj1(n);
+//!   auto [num_ccs1, is_bridge1, br_id1] = bridges(adj1,
+//!   m);
 //! @endcode
 //! is_bridge[edge id] = 1 iff bridge edge
 //! br_id[v] = id, 0<=id<num_ccs
 //! @time O(n + m)
 //! @space O(n + m)
-struct bridges {
+template<class G> struct bridges {
   int num_ccs = 0;
   vector<bool> is_bridge;
   vi br_id;
-  bridges(const vector<vector<pii>>& adj, int m):
+  bridges(const G& adj, int m):
     is_bridge(m), br_id(sz(adj), -1) {
     int n = sz(adj), timer = 1;
     vi tin(n), st;

library/graphs/bridges_cuts/cuts.hpp

@@ -11,16 +11,18 @@
 //!     adj[v].emplace_back(u, i);
 //!   }
 //!   auto [num_bccs, is_cut, bcc_id] = cuts(adj, m);
+//!   vector<basic_string<array<int,2>>> adj1(n);
+//!   auto [num_bccs1, is_cut1, bcc_id1] = cuts(adj1, m);
 //! @endcode
 //! is_cut[v] = 1 iff cut node
 //! bcc_id[edge id] = id, 0<=id<num_bccs
 //! @time O(n + m)
 //! @space O(n + m)
-struct cuts {
+template<class G> struct cuts {
   int num_bccs = 0;
   vector<bool> is_cut;
   vi bcc_id;
-  cuts(const vector<vector<pii>>& adj, int m):
+  cuts(const G& adj, int m):
     is_cut(sz(adj)), bcc_id(m, -1) {
     int n = sz(adj), timer = 1;
     vi tin(n), st;

library/graphs/complement_graph_ccs.hpp

@@ -1,15 +1,18 @@
 #pragma once
 //! @code
 //!   vector<vi> adj(n);
-//!   auto cc_id = get_complement_graph_ccs(adj);
+//!   vi cc_id = get_complement_graph_ccs(adj);
+//!   vector<basic_string<int>> adj1;
+//!   vi cc_id2 = get_complement_graph_ccs(adj1);
 //! @endcode
 //! 0<=cc_id[v]<number of connected components
 //!   in the complement graph
 //! cc_id[u] == cc_id[v] if u,v are in the same
 //!   cc in the compliment graph
 //! @time O(n + m)
 //! @space O(n)
-vi get_complement_graph_ccs(const vector<vi> &adj) {
+template<class G>
+vi get_complement_graph_ccs(const G& adj) {
   int n = sz(adj);
   vi cc_id(n), unseen(n);
   iota(all(unseen), 0);

library/graphs/dijkstra.hpp

@@ -2,6 +2,8 @@
 //! @code
 //!   vector<vector<pair<int, ll>>> adj(n);
 //!   auto d = dijkstra(adj, source);
+//!   vector<basic_string<array<int, 2>>> adj1(n);
+//!   auto d1 = dijkstra(adj1, source);
 //! @endcode
 //! d[v] = min dist from source->..->v
 //! @time O(n + (m log m))

library/graphs/hopcroft_karp.hpp

@@ -5,6 +5,8 @@
 //!   adj[l].push_back(r); // add edge l <-> r
 //!   auto [matching_size, to_r, to_l,
 //!     mvc_l, mvc_r] = hopcroft_karp(adj, rsz);
+//!   vector<basic_string<int>> adj1(lsz);
+//!   hopcroft_karp match(adj1);
 //! @endcode
 //! 0<=l<lsz; 0<=r<rsz
 //! l <-> to_r[l] in matching if to_r[l]!=-1

library/graphs/strongly_connected_components/scc.hpp

@@ -3,6 +3,8 @@
 //! @code
 //!   vector<vi> adj(n);
 //!   auto [num_sccs, scc_id] = sccs(adj);
+//!   vector<basic_string<int>> adj1(n);
+//!   auto [num_sccs1, scc_id1] = sccs(adj1);
 //! @endcode
 //! scc_id[v] = id, 0<=id<num_sccs
 //! for each edge u -> v: scc_id[u] >= scc_id[v]

library/trees/centroid_decomp.hpp

@@ -4,14 +4,18 @@
 //!   centroid(adj, [&](const vector<vi>& adj,
 //!     int cent, int par_cent) {
 //!   });
+//!   vector<basic_string<int>> adj1(n);
+//!   centroid(adj1,
+//!     [&](const vector<basic_string<int>>& adj1,
+//!     int cent, int par_cent) {});
 //! @endcode
 //! @time O(n log n)
 //! @space O(n)
-template<class F> struct centroid {
-  vector<vi> adj;
+template<class F, class G> struct centroid {
+  G adj;
   F f;
   vi siz;
-  centroid(const vector<vi>& adj, F f):
+  centroid(const G& adj, F f):
     adj(adj), f(f), siz(sz(adj), -1) {
     rep(i, 0, sz(adj)) if (siz[i] == -1) dfs(i, -1);
   }

library/trees/edge_cd.hpp

@@ -11,15 +11,19 @@
 //!     // subtrees of suffix [split, sz(adj[cent]))
 //!     //   of adj[cent] are the second edge-set
 //!   });
+//!   vector<basic_string<int>> adj1(n);
+//!   edge_cd(adj1, [&](
+//!     const vector<basic_string<int>>& adj1,
+//!     int cent, int split) {});
 //! @endcode
 //! handle single-edge-paths separately
 //! @time O(n log1.5 n)
 //! @space O(n)
-template<class F> struct edge_cd {
-  vector<vi> adj;
+template<class F, class G> struct edge_cd {
+  G adj;
   F f;
   vi sub_sz;
-  edge_cd(const vector<vi>& adj, F f):
+  edge_cd(const G& adj, F f):
     adj(adj), f(f), sub_sz(sz(adj)) {
     dfs(0, sz(adj));
   }