[LeetCode]Clone Graph

Graph分类里面的题好少orz而且还嗨难，心累

找了一道clonegraph，做起来还是挺难的

133

Clone Graph

25.1%

Medium

题目要求：

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时在BFS遍历领接点的话，如果领接点已经被copy过了，就不能重新copy一个结点，不然就跟原来的图不一样了。这里用了一下unordered_map，可以把原来的图跟clone的图对应起来。这道题如果不用unordered_map的话，会很复杂，需要在自己去把结点去对应起来。

另外要注意的就是在clone的时候，如果领接点是自己的话，就不把领接点放进toVisited的队列里，不然就会出现死循环停不了，我就是在这里出错了卡了好久。

一开始写了一个BFS函数，但是因为递归没写好，导致死循环跳不出来，最后还是改用while来写了。

其他要注意的好像没有很多了，上代码吧

tr1::unordered_map<UndirectedGraphNode*, UndirectedGraphNode*> mp;

void BFS(queue<UndirectedGraphNode*>& uncopy)
{
	UndirectedGraphNode* temp=uncopy.front();
	uncopy.pop();
	cout<<"do if"<<endl;
	//cout<<"node->neighbors.size()="<<node->neighbors.size()<<endl;
	for(int i=0;i<temp->neighbors.size();i++)
	{
		//cout<<"isInList(node->neighbors[i]->label,all)="<<isInList(node->neighbors[i]->label,all)<<endl;
		if(mp.find(temp->neighbors[i])==mp.end())
		{
			cout<<"do if 2"<<endl;
			UndirectedGraphNode* cloneneigh=new UndirectedGraphNode(temp->neighbors[i]->label);
			mp[temp->neighbors[i]]=cloneneigh;
			uncopy.push(temp->neighbors[i]);
			mp[temp]->neighbors.push_back(cloneneigh);
		}
		else
		{
			cout<<"do else"<<endl;
			uncopy.push(temp->neighbors[i]);
	    	mp[temp]->neighbors.push_back(new UndirectedGraphNode(temp->neighbors[i]->label));
		}
 	}
 	BFS(uncopy);
}


UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) 
{
	if(node==NULL)
	{
		return NULL;
	}
	UndirectedGraphNode* newNode=new UndirectedGraphNode(node->label);
	mp[node]=newNode;
	
	UndirectedGraphNode* head=newNode;
	queue<UndirectedGraphNode*> uncopy;
	uncopy.push(node);
	//BFS(uncopy);
	while(!uncopy.empty())
	{
		UndirectedGraphNode* temp=uncopy.front();
		uncopy.pop();
		cout<<"do if"<<endl;
		//cout<<"node->neighbors.size()="<<node->neighbors.size()<<endl;
		for(int i=0;i<temp->neighbors.size();i++)
		{
			//cout<<"isInList(node->neighbors[i]->label,all)="<<isInList(node->neighbors[i]->label,all)<<endl;
			if(mp.find(temp->neighbors[i])==mp.end())
			{
				//cout<<"do if 2"<<endl;
				UndirectedGraphNode* cloneneigh=new UndirectedGraphNode(temp->neighbors[i]->label);
				mp[temp->neighbors[i]]=cloneneigh;
				uncopy.push(temp->neighbors[i]);
				mp[temp]->neighbors.push_back(mp[temp->neighbors[i]]);
			}
			else
			{
				//cout<<"do else"<<endl;
				//uncopy.push(temp->neighbors[i]);
		    	mp[temp]->neighbors.push_back(mp[temp->neighbors[i]]);
			}
 		}
	}
	return newNode;
}