LeetCode--Clone Graph

Clone Graph

1. 题目

Given the head of a graph, return a deep copy (clone) of the graph. Each node in the graph contains a label (int) and a list (List[UndirectedGraphNode]) of its neighbors. There is an edge between the given node and each of the nodes in its neighbors.

OJ's undirected graph serialization (so you can understand error output):

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
         / \
         \_/

Note: The information about the tree serialization is only meant so that you can understand error output if you get a wrong answer. You don't need to understand the serialization to solve the problem.

2. 分析

      这题的数据结构题目已经明确给出，我们可以看到，这个数据结构就是树的递归定义，节点的左子树和右子树也是一棵树。

这里看起来像是需要递归的定义去实现，其实不是，通过树的类广度遍历（与广度遍历有点差别），可以同时遍历父节点和其子节点。这里的难点是发现未被访问的节点后，如何同时定位到新链的同一个节点，我们采取一个map的数据结构，map<旧节点，新节点>，这样可以很好的解决这个问题。

3. 源码

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;
        set<UndirectedGraphNode *> s;
        UndirectedGraphNode *newGraph = new UndirectedGraphNode(node->label);
        UndirectedGraphNode *resultGraph = newGraph;
        //通过旧的点找到新图的点，因为需要新图的连接
        map<UndirectedGraphNode *, UndirectedGraphNode *> m;
        
        q.push(node);
        s.insert(node);
        m[node] = newGraph;
        while(!q.empty()) {
        	//一层的顶点
        	int size = q.size();
        	for(int i = 0; i < size; i++) {
        		UndirectedGraphNode *temp = q.front();
        		UndirectedGraphNode *end = m[temp];
        		q.pop();
        		for(int j = 0; j < temp->neighbors.size(); j++) {
        			if(s.find(temp->neighbors[j]) == s.end()) {
        				s.insert(temp->neighbors[j]);
        				q.push(temp->neighbors[j]);
        			}
        			if(m.find(temp->neighbors[j]) == m.end()) {
        				UndirectedGraphNode* copiedNeighbor = new UndirectedGraphNode(temp->neighbors[j]->label);
                        m[temp->neighbors[j]] = copiedNeighbor;
        			}
        			//将一个图接起来
        			end->neighbors.push_back(m[temp->neighbors[j]]);
        		}
        		
        	}
        	
        }
        return resultGraph;
    }
};

## [更多技术博客](https://vilin.club/)：https://vilin.club/