Clone Graph

Clone Graph

lone 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
         / \
         \_/

/**
 * Definition for undirected graph.
 * class UndirectedGraphNode {
 *     int label;
 *     List<UndirectedGraphNode> neighbors;
 *     UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); }
 * };
 */

// ref: http://www.cnblogs.com/springfor/p/3874591.html

public class Solution {
    public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        if(node==null) return null;
        
        HashMap<UndirectedGraphNode,UndirectedGraphNode> hm = new HashMap<UndirectedGraphNode, UndirectedGraphNode>();
        UndirectedGraphNode head = new UndirectedGraphNode(node.label);
        hm.put(node, head);
        dfs(hm, node);  // note here is node, the original graph's information, not head
        return head;
    }
    
    private void dfs(HashMap<UndirectedGraphNode,UndirectedGraphNode> hm, UndirectedGraphNode node){
        if (node==null) return;
        
        for(UndirectedGraphNode a_nbr: node.neighbors ){
            if(!hm.containsKey(a_nbr)){
                UndirectedGraphNode new_nbr = new UndirectedGraphNode(a_nbr.label);
                hm.put(a_nbr, new_nbr);
                dfs(hm, a_nbr); // note here is a_nbr, the original graph's information, not new_nbr
            }
            // hm.get(node).neighbors.add(a_nbr); 
            hm.get(node).neighbors.add(hm.get(a_nbr)); // note the difference from above one
        }
    }
    
}