Clone Graph 图的复制 @LeetCode

思路：

图的复制，基于BFS，用到了Hashtable来去重

参考：

图的遍历有两种方式，BFS和DFS

这里使用BFS来解本题，BFS需要使用queue来保存neighbors

但这里有个问题，在clone一个节点时我们需要clone它的neighbors，而邻居节点有的已经存在，有的未存在，如何进行区分？

这里我们使用Map来进行区分，Map的key值为原来的node，value为新clone的node，当发现一个node未在map中时说明这个node还未被clone，

将它clone后放入queue中处理neighbors。

使用Map的主要意义在于充当BFS中Visited数组，它也可以去环问题，例如A--B有条边，当处理完A的邻居node，然后处理B节点邻居node时发现A已经处理过了

处理就结束，不会出现死循环！

queue中放置的节点都是未处理neighbors的节点！！！！

http://www.cnblogs.com/feiling/p/3351921.html

http://leetcode.com/2012/05/clone-graph-part-i.html

package Level5;

import java.util.ArrayList;
import java.util.Hashtable;
import java.util.LinkedList;

import Utility.UndirectedGraphNode;


/**
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 #.

First node is labeled as 0. Connect node 0 to both nodes 1 and 2.
Second node is labeled as 1. Connect node 1 to node 2.
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
         / \
         \_/
Discuss


 */
public class S146 {

	public static void main(String[] args) {

	}
	
	public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        if(node == null){
        	return null;
        }
        
        LinkedList<UndirectedGraphNode> queue = new LinkedList<UndirectedGraphNode>();		// BFS用的queue
        // Hashtable<node, clonedNode> 放原始node和其复制品
        Hashtable<UndirectedGraphNode, UndirectedGraphNode> ht = new Hashtable<UndirectedGraphNode, UndirectedGraphNode>();	// 去重用的ht
        UndirectedGraphNode retClone = new UndirectedGraphNode(node.label);	// 根节点的复制
    	ht.put(node, retClone);		// 把根节点和其复制品放入ht
        queue.add(node);		//添加入队列
        
        while(!queue.isEmpty()){
        	UndirectedGraphNode cur = queue.remove();		// 当前处理对象
        	UndirectedGraphNode curClone = ht.get(cur);	// 当前处理对象的复制品，必定在ht里，因为在前面的neighbor里已经被创建
        	
        	ArrayList<UndirectedGraphNode> neighbors = cur.neighbors;	// 得到当前原始对象的所有neighbor
        	for(int i=0; i<neighbors.size(); i++){		// 对每一个neighbor进行判断，因为有的neighbor已经被复制，有的没有
        		UndirectedGraphNode neighbor = neighbors.get(i);
        		if(ht.containsKey(neighbor)){		// 之前已经被复制过的neighbor
        			UndirectedGraphNode neighborClone = ht.get(neighbor);	// 就直接从ht里取出neighborClone
        			curClone.neighbors.add(neighborClone);		// 给curClone添加复制的neighbor
        		}else{	// 如果该neighbor没有被复制过，则新建neighborClone
        			UndirectedGraphNode neighborClone = new UndirectedGraphNode(neighbor.label);
        			curClone.neighbors.add(neighborClone);
        			ht.put(neighbor, neighborClone);		// 存储到ht里
        			queue.add(neighbor);		// 并且添加到队列里为了将来的遍历
        		}
        	}
        }
        
        return retClone;
    }

	
}

关键就是两点：

1 图的遍历 BFS或DFS

2 Hashtable<original node, copied node>

/**
 * Definition for undirected graph.
 * class UndirectedGraphNode {
 *     int label;
 *     List<UndirectedGraphNode> neighbors;
 *     UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); }
 * };
 */
 
import java.util.*;
public class Solution {
    public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        if(node == null) {
            return null;
        }
        
        // Ht<original node, copied node>
        Hashtable<UndirectedGraphNode, UndirectedGraphNode> ht = new Hashtable<UndirectedGraphNode, UndirectedGraphNode>();
        LinkedList<UndirectedGraphNode> queue = new LinkedList<UndirectedGraphNode>();      // for BFS
        queue.add(node);
        
        UndirectedGraphNode copyHead = null;
        
        while(!queue.isEmpty()) {
            UndirectedGraphNode cur = queue.remove();
            UndirectedGraphNode copy = ht.get(cur);     // copy of current node
            if(copy == null) {
                copy = new UndirectedGraphNode(cur.label);
                List<UndirectedGraphNode> copynei = new ArrayList<UndirectedGraphNode>();   // create empty copied node neighbor
                copy.neighbors = copynei;
                ht.put(cur, copy);
            } 
            if(copyHead == null) {      // first node to return
                copyHead = copy;
            }
            
            List<UndirectedGraphNode> nei = cur.neighbors;
            List<UndirectedGraphNode> copynei = copy.neighbors;
            for(UndirectedGraphNode x : nei) {          // check with each original node of current neighbors
                UndirectedGraphNode copyX = ht.get(x);
                if(copyX == null) {     // if that original node has not got a copy, create it, add to ht and queue
                    copyX = new UndirectedGraphNode(x.label);
                    ht.put(x, copyX);
                    queue.add(x);
                } 
                copynei.add(copyX);
            }
        }
        
        return copyHead;
    }
}

public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
    if(node == null)
        return null;
    HashMap<UndirectedGraphNode, UndirectedGraphNode> map = new HashMap<UndirectedGraphNode, UndirectedGraphNode>();
    UndirectedGraphNode copy = new UndirectedGraphNode(node.label);
    map.put(node,copy);
    helper(node,map);
    return copy;
}
private void helper(UndirectedGraphNode node, HashMap<UndirectedGraphNode, UndirectedGraphNode> map)
{
    for(int i=0;i<node.neighbors.size();i++)
    { 
        UndirectedGraphNode cur = node.neighbors.get(i);
        if(!map.containsKey(cur))
        {
            UndirectedGraphNode copy = new UndirectedGraphNode(cur.label);
            map.put(cur,copy);
            helper(cur,map);
        }
        map.get(node).neighbors.add(map.get(cur));
    }
}

http://blog.csdn.net/linhuanmars/article/details/22715747