Remove Max Number of Edges to Keep Graph Fully Traversable

Alice and Bob have an undirected graph of n nodes and 3 types of edges:

• Type 1: Can be traversed by Alice only.
• Type 2: Can be traversed by Bob only.
• Type 3: Can by traversed by both Alice and Bob.

Given an array edges where edges[i] = [typei, ui, vi] represents a bidirectional edge of type typei between nodes ui and vi, find the maximum number of edges you can remove so that after removing the edges, the graph can still be fully traversed by both Alice and Bob. The graph is fully traversed by Alice and Bob if starting from any node, they can reach all other nodes.

Return the maximum number of edges you can remove, or return -1 if it's impossible for the graph to be fully traversed by Alice and Bob.

 

Example 1:

Input: n = 4, edges = [[3,1,2],[3,2,3],[1,1,3],[1,2,4],[1,1,2],[2,3,4]]
Output: 2
Explanation: If we remove the 2 edges [1,1,2] and [1,1,3]. The graph will still be fully traversable by Alice and Bob. Removing any additional edge will not make it so. So the maximum number of edges we can remove is 2.

Example 2:

Input: n = 4, edges = [[3,1,2],[3,2,3],[1,1,4],[2,1,4]]
Output: 0
Explanation: Notice that removing any edge will not make the graph fully traversable by Alice and Bob.

Example 3:

Input: n = 4, edges = [[3,2,3],[1,1,2],[2,3,4]]
Output: -1
Explanation: In the current graph, Alice cannot reach node 4 from the other nodes. Likewise, Bob cannot reach 1. Therefore it's impossible to make the graph fully traversable.

Constraints:

• 1 <= n <= 10^5
• 1 <= edges.length <= min(10^5, 3 * n * (n-1) / 2)
• edges[i].length == 3
• 1 <= edges[i][0] <= 3
• 1 <= edges[i][1] < edges[i][2] <= n
• All tuples (typei, ui, vi) are distinct.

思路：主要弄清楚怎么区分两个人的traverse，首先用3公共的边去连，然后分别连，这里为了区分两个人的path，用两个unionFind的class即可； 

class Solution {
    private class UnionFind {
        public int[] father;
        public int size;
        
        public UnionFind(int n) {
            this.father = new int[n + 1];
            for(int i = 0; i <= n; i++) {
                father[i] = i;
            }
            this.size = n;
        }
        
        public int find(int x) {
            int j = x;
            while(father[j] != j) {
                j = father[j];
            }
            
            // path compression;
            while(x != j) {
                int fx = father[x];
                father[x] = j;
                x = fx;
            }
            return j;
        }
        
        public void union(int a, int b) {
            int root_a = find(a);
            int root_b = find(b);
            if(root_a != root_b) {
                father[root_a] = root_b;
                size--;
            }
        }
    }
    
    public int maxNumEdgesToRemove(int n, int[][] edges) {
        Arrays.sort(edges, (a, b) -> (b[0] - a[0]));
        UnionFind uf1 = new UnionFind(n);
        UnionFind uf2 = new UnionFind(n);
        
        int count = 0;
        for(int[] edge: edges) {
            int type = edge[0];
            int a = edge[1];
            int b = edge[2];
            if(type == 3) {
                if(uf1.find(a) != uf1.find(b)) {
                    uf1.union(a, b);
                    uf2.union(a, b);
                } else {
                    count++;
                }
            } else if(type == 2) {
                if(uf2.find(a) != uf2.find(b)) {
                    uf2.union(a, b);
                } else {
                    count++;
                }
            } else {
                if(uf1.find(a) != uf1.find(b)) {
                    uf1.union(a, b);
                } else {
                    count++;
                }
            }
        }
        
        return uf1.size == 1 && uf2.size == 1 ? count : -1;
    }
}