133. Clone Graph

题目：

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:

代码：

/**
 * 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;
        Map<Integer,UndirectedGraphNode> map = new HashMap<Integer, UndirectedGraphNode>();
        LinkedList<UndirectedGraphNode> queue = new LinkedList<UndirectedGraphNode>();
        queue.add(node);
        UndirectedGraphNode newnode = new UndirectedGraphNode(node.label);
        map.put(node.label, newnode);
        while(!queue.isEmpty())
        {
        	UndirectedGraphNode cur = queue.pop();
        	for(UndirectedGraphNode temp : cur.neighbors)
        	{
        		if(map.containsKey(temp.label))
        		{
        			map.get(cur.label).neighbors.add(map.get(temp.label));
        		}
        		else
        		{
        			UndirectedGraphNode tempnode = new UndirectedGraphNode(temp.label);
        			map.put(tempnode.label, tempnode);
        			map.get(cur.label).neighbors.add(tempnode);
        			queue.add(temp);
        		}
        	}
        }
        return newnode;
    }
}

方法二，采用dfs:

代码：

	public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
		if(node == null)return null;
		Map<Integer,UndirectedGraphNode> map = new HashMap<Integer, UndirectedGraphNode>();
		UndirectedGraphNode newnode = new UndirectedGraphNode(node.label);
		map.put(node.label, newnode);
		dfs(node,map);
		return newnode;
	}
	public void dfs(UndirectedGraphNode node,Map<Integer,UndirectedGraphNode> map){
		if(node == null)return;
		for(UndirectedGraphNode temp:node.neighbors)
		{
			if(!map.containsKey(temp.label))
			{
				UndirectedGraphNode copy = new UndirectedGraphNode(temp.label);
				map.put(temp.label, copy);
				dfs(temp,map);
			}
			map.get(node.label).neighbors.add(map.get(temp.label));
		}
	}