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解法：

class Solution {
     map<UndirectedGraphNode*,UndirectedGraphNode*> vis;
public:
    UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
        queue<UndirectedGraphNode*> q;
        if(!node) return NULL;
        q.push(node);
        UndirectedGraphNode* ans=new UndirectedGraphNode(node->label);
        vis[node]=ans;
        while(!q.empty())
        {
            UndirectedGraphNode* u=q.front();
            q.pop();
            for(auto it:u->neighbors)
            {
            if(vis.find(it)==vis.end())
            {
                vis[it]=new UndirectedGraphNode(it->label);
                q.push(it);
            }
             vis[u]->neighbors.push_back(vis[it]);
            }
        }
        return ans;
    }
};

DFS解法：

class Solution {
    map
    
    
     
      vis;
    UndirectedGraphNode* cloneg(UndirectedGraphNode* node)
    {
        if(!node)
        return NULL;
        if(vis.find(node->label)!=vis.end())
        return vis[node->label];
        UndirectedGraphNode* clone=new UndirectedGraphNode(node->label);
        vis.insert(pair
     
     
      
      (clone->label,clone));
        for(auto it:node->neighbors)
        {
            (clone->neighbors).push_back(cloneg(it));
        }
        return clone;
    }
public:
    UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
        return cloneg(node);
    }
};