Clone Graph

Q:

Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.

OJ's undirected graph serialization:

Nodes are labeled uniquely.

We use  # as a separator for each node, and  , as a separator for node label and each neighbor of the node.

As an example, consider the serialized graph {0,1,2#1,2#2,2}.

The graph has a total of three nodes, and therefore contains three parts as separated by #.

1. First node is labeled as 0. Connect node 0 to both nodes 1 and 2.
2. Second node is labeled as 1. Connect node 1 to node 2.
3. Third node is labeled as 2. Connect node 2 to node 2 (itself), thus forming a self-cycle.

Visually, the graph looks like the following:

       1
      / \
     /   \
    0 --- 2
         / \
         \_/

Solution:

/**
 * 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 ret = new UndirectedGraphNode(node.label);
        Map<UndirectedGraphNode, UndirectedGraphNode> clones = new HashMap<UndirectedGraphNode, UndirectedGraphNode>();
        clones.put(node, ret);
        Queue<UndirectedGraphNode> queue = new LinkedList<UndirectedGraphNode>();
        queue.offer(node);
        while (!queue.isEmpty()) {
            UndirectedGraphNode temp = queue.poll();
            UndirectedGraphNode newNode = clones.get(temp);
            // this should not happen
            if (newNode == null)   
                continue;
            for (int i = 0; i < temp.neighbors.size(); i++) {
                UndirectedGraphNode e = temp.neighbors.get(i);
                if (clones.get(e) == null) {
                    UndirectedGraphNode newe = new UndirectedGraphNode(e.label);
                    clones.put(e, newe);
                    newNode.neighbors.add(newe);
                    queue.offer(e);
                }
                else {
                    UndirectedGraphNode exist = clones.get(e);
                    newNode.neighbors.add(exist);
                }
                
            }

        }
        return ret;
    }
}