update

Changes

2 changed files (+2/-4)

• Data Structures/union-find_disjoint_set.cpp
  • @@ -9,8 +9,8 @@ public:
    int find_set(int i) { return (p[i] == i) ? i : (p[i] = find_set(p[i])); } bool same_set(int i, int j) { return find_set(i) == find_set(j); } void union_set(int i, int j) { - if (same_set(i, j)) return; int x = find_set(i), y = find_set(j); + if (x == y) return; rank[x] > rank[y] ? p[y] = x : p[x] = y; if (rank[x] == rank[y]) rank[y]++; }
• Graph/tarjan_scc.cpp
  • @@ -22,6 +22,4 @@ void tarjan(int u) {
    memset(scc, -1, sizeof scc), memset(in, -1, sizeof in); - for (int u = 1; u <= N; u++) { - if (scc[u] == -1) tarjan(u); - } + for (int u = 1; u <= N; ++u) if (scc[u] == -1) tarjan(u);