Clone Graph

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

思路： 用BFS 来进行图的遍历， 但是由于要新旧节点一一对应， 所以要创建一个hashmap 来存储对应关系， 

同时也可以防止有循环存在。

易错点： 判断 hashmap 是否存在当前neighbor，如果存在就直接连接， 如果不存在，要创建新节点， 

还要准备对应关系，插入队列。

/**
 * 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;
        //old node to new node.
        HashMap<UndirectedGraphNode, UndirectedGraphNode> map = new HashMap<UndirectedGraphNode, UndirectedGraphNode>();
        Queue<UndirectedGraphNode> queue = new LinkedList<UndirectedGraphNode>();
        queue.add(node);
        map.put(node, new UndirectedGraphNode(node.label));
        //Using BSF to traverse the graph
        while(!queue.isEmpty()){
            UndirectedGraphNode curNode = queue.poll();
            UndirectedGraphNode newNode = map.get(curNode);
            for(UndirectedGraphNode neighbor : curNode.neighbors){
                if(map.containsKey(neighbor)){
                    newNode.neighbors.add(map.get(neighbor));
                }else{
                    UndirectedGraphNode newNeighbor = new UndirectedGraphNode(neighbor.label);
                    map.put(neighbor, newNeighbor);
                    queue.add(neighbor);
                    newNode.neighbors.add(newNeighbor);
                }
            }
        }
        
        return map.get(node);
    }
}