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.

思路：

广度优先遍历

变量说明：

映射表m用来保存原图结点与克隆结点的对应关系。

映射表visited用来记录已经访问过的原图结点，防止循环访问。

队列q用于记录广度优先遍历的层次信息。

class Solution {
public:
    UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
        if(node == NULL)
            return NULL;
        // map from origin node to copy node
        unordered_map<UndirectedGraphNode *, UndirectedGraphNode *> m;
        unordered_map<UndirectedGraphNode *, bool> visited;
        queue<UndirectedGraphNode*> q;
        q.push(node);
        while(!q.empty())
        {// BFS
            UndirectedGraphNode* front = q.front();
            q.pop();
            
            if(visited[front] == false)
            {
                visited[front] = true;
                
                UndirectedGraphNode* cur;
                if(m.find(front) == m.end())
                {
                    cur = new UndirectedGraphNode(front->label);
                    m[front] = cur;
                }
                else
                {
                    cur = m[front];
                }
                for(int i = 0; i < front->neighbors.size(); i ++)
                {
                    if(m.find(front->neighbors[i]) == m.end())
                    {
                        UndirectedGraphNode* nei = new UndirectedGraphNode(front->neighbors[i]->label);
                        m[front->neighbors[i]] = nei;
                        cur->neighbors.push_back(nei);
                            
                        q.push(front->neighbors[i]);
                    }
                    else
                    {
                        cur->neighbors.push_back(m[front->neighbors[i]]);
                    }
                }
            }
        }
        return m[node];
    }
};