Clone Graph

BFS with HashMap

/**
 * 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;
        }
        
        Queue<UndirectedGraphNode> q = new LinkedList<UndirectedGraphNode>();
        Map<UndirectedGraphNode, UndirectedGraphNode> map = 
            new HashMap<UndirectedGraphNode, UndirectedGraphNode>();
        
        UndirectedGraphNode newHead = new UndirectedGraphNode(node.label);
        
        q.offer(node);
        map.put(node, newHead);
        
        while (!q.isEmpty()) {
            UndirectedGraphNode current = q.poll();
            List<UndirectedGraphNode> currentNeighbors = current.neighbors;
            
            for (UndirectedGraphNode temp : currentNeighbors) {
                if (!map.containsKey(temp)) {
                    UndirectedGraphNode newNode = new UndirectedGraphNode(temp.label);
                    map.put(temp, newNode);
                    map.get(current).neighbors.add(newNode);
                    q.offer(temp);
                } else {
                    map.get(current).neighbors.add(map.get(temp));
                }
            }
        }
        
        return newHead;
    }
}