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， 一种DFS。java的话BFS常用一个队列来做。写几遍之后应该就可以理解了。直接上代码：

BFS：

public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        if(node == null) return null;
        
        HashMap<UndirectedGraphNode, UndirectedGraphNode> map = new HashMap<>();
        Queue<UndirectedGraphNode> queue = new LinkedList<>();
        //map.put(node, new UndirectedGraphNode(node.label));
        queue.offer(node);
        while(!queue.isEmpty()){
            UndirectedGraphNode curNode = queue.poll();
            if(!map.containsKey(curNode)){
                map.put(curNode, new UndirectedGraphNode(curNode.label));
            }
            
            for(UndirectedGraphNode neighbor: curNode.neighbors){
                if(!map.containsKey(neighbor)){
                    UndirectedGraphNode neighborCopy = new UndirectedGraphNode(neighbor.label);
                    map.put(neighbor, neighborCopy);
                    
                    queue.offer(neighbor);
                }
                map.get(curNode).neighbors.add(map.get(neighbor));
            }
        }
        return map.get(node);
    }

DFS：

HashMap<UndirectedGraphNode, UndirectedGraphNode> map = new HashMap<UndirectedGraphNode, UndirectedGraphNode>();
    public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        if(node == null) return null;
        UndirectedGraphNode copy = new UndirectedGraphNode(node.label);
        map.put(node, copy);
        for(UndirectedGraphNode neighbor: node.neighbors){
            if(map.containsKey(neighbor)){
                copy.neighbors.add(map.get(neighbor));
            }else{
                UndirectedGraphNode neighborCopy = cloneGraph(neighbor);
                map.put(neighbor, neighborCopy);
                copy.neighbors.add(neighborCopy);
            }
        }
        return copy;
    }