133. 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等解法。以下主要讲的是BFS 的解法。为了clone无向图，我们必须每个点都要复制，每个点只能遍历一次，需要判断点是否被重复访问。队列q用于记录BFS遍历的层次信息。

/**
 * Definition for undirected graph.
 * struct UndirectedGraphNode {
 *     int label;
 *     vector<UndirectedGraphNode *> neighbors;
 *     UndirectedGraphNode(int x) : label(x) {};
 * };
 */
class Solution {
public:
    UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
        if(node == NULL)
        	return NULL;
        queue<UndirectedGraphNode*> q; 
        map<UndirectedGraphNode*, UndirectedGraphNode*> m;
        UndirectedGraphNode *nodeCopy = new UndirectedGraphNode(node->label);	
        q.push(node);
        m[node] = nodeCopy;
	    while(!q.empty()) { 
	    	UndirectedGraphNode* d = q.front();
	    	q.pop();
	    	for(auto neighbor: d->neighbors) {
	    		if(m.find(neighbor)==m.end()) {
	    			auto copy = new UndirectedGraphNode(neighbor->label); 
	    			m[neighbor] = copy;
	    			q.push(neighbor);
	    		}
                m[d]->neighbors.push_back(m[neighbor]);
	    	}
	    }
	    return nodeCopy;
    }
};

end!