Clone Graph

/**
 * 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 nodeCopy = new UndirectedGraphNode(node.label);
        Map<UndirectedGraphNode, UndirectedGraphNode> map = new HashMap<>();
        map.put(node, nodeCopy);
        Queue<UndirectedGraphNode> queue = new LinkedList<>();
        queue.offer(node);
        while (!queue.isEmpty()) {
            UndirectedGraphNode n = queue.poll();
            UndirectedGraphNode nc = map.get(n);
            for (UndirectedGraphNode neighbor: n.neighbors) {
                if (!map.containsKey(neighbor)) {
                    UndirectedGraphNode neighborCopy = new UndirectedGraphNode(neighbor.label);
                    map.put(neighbor, neighborCopy);
                    nc.neighbors.add(neighborCopy);
                    queue.offer(neighbor);
                } else {
                    UndirectedGraphNode neighborCopy = map.get(neighbor);
                    nc.neighbors.add(neighborCopy);
                }
            }
        }
        return nodeCopy;
    }
}