LeetCode——Clone Graph

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，DFS为递归算法。BFS利用queue实现。本题采用BFS实现（DFS也可以）。技巧为用一个map<key,value>存储访问过的node，可以避免死循环。其中key为old node，value为new node。
代码：

class Solution {
public:
	UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
		if (node == NULL)
			return NULL;
		UndirectedGraphNode *ret = new UndirectedGraphNode(node->label);
		map<UndirectedGraphNode *, UndirectedGraphNode *> mp;//key存储old node，value存储new node
		mp[node] = ret;
		queue<UndirectedGraphNode *> que;
		que.push(node);

		UndirectedGraphNode *tmp = NULL, *nxt = NULL;
		while (!que.empty()) {
			tmp = que.front();
			que.pop();
			for (int i = 0; i < (tmp->neighbors).size(); i++) {
				nxt = (tmp->neighbors)[i];
				if (mp.find(nxt) == mp.end()) {//表示没有被访问过
					mp[nxt] = new UndirectedGraphNode(nxt->label);
					que.push(nxt);
				}
				(mp[tmp]->neighbors).push_back(mp[nxt]);
			}
		}
		return ret;
	}
};