java 133.克隆图（BFS）.java

Posted 2021-05-08

/**
 * Definition for undirected graph.
 * class UndirectedGraphNode {
 *     int label;
 *     List<UndirectedGraphNode> neighbors;
 *     UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); }
 * };
 */
public class Solution {
    public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        if (node == null) return null;
        Map<UndirectedGraphNode, UndirectedGraphNode> map = new HashMap<>();
        return dfs(node, map);
    }
    
    private UndirectedGraphNode dfs(UndirectedGraphNode node, Map<UndirectedGraphNode, UndirectedGraphNode> map) {
        UndirectedGraphNode clone =  map.get(node);
        if (clone != null) {
            return clone;
        }
        clone = new UndirectedGraphNode(node.label);
        map.put(node, clone);
        for (UndirectedGraphNode c : node.neighbors) {
            clone.neighbors.add(dfs(c, map));
        }
        return clone;
    }
}

/**
 * Definition for undirected graph.
 * class UndirectedGraphNode {
 *     int label;
 *     List<UndirectedGraphNode> neighbors;
 *     UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); }
 * };
 */
public class Solution {
    public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        if(node == null) return null;
        UndirectedGraphNode newNode = new UndirectedGraphNode(node.label);
        HashMap<Integer, UndirectedGraphNode> map = new HashMap<Integer, UndirectedGraphNode>(); //store visited nodes
        Queue<UndirectedGraphNode> queue = new LinkedList<UndirectedGraphNode>();
        
        map.put(newNode.label, newNode);
        queue.offer(node);
        
        while(!queue.isEmpty()) {
            UndirectedGraphNode cur = queue.poll();
            
            for(UndirectedGraphNode neighbor : cur.neighbors) {
                if(!map.containsKey(neighbor.label)) {
                    map.put(neighbor.label, new UndirectedGraphNode(neighbor.label));
                    queue.add(neighbor);
                }
                map.get(cur.label).neighbors.add(map.get(neighbor.label));
            }
            
        }
        return newNode;
        
    }
}