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

/**
 * Definition for undirected graph.
 * struct UndirectedGraphNode {
 *     int label;
 *     vector<UndirectedGraphNode *> neighbors;
 *     UndirectedGraphNode(int x) : label(x) {};
 * };
 */
class Solution {
public:
    UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
        if(node == NULL)
            return node;
        return clone(node);
        
        
    }
private:
    UndirectedGraphNode *clone(UndirectedGraphNode *node)
    {
        UndirectedGraphNode *newNode = new UndirectedGraphNode(node->label);
        m_map[node->label] = newNode;
        
        for(int i = 0; i < node->neighbors.size(); i++)
        {
            if(m_map[node->neighbors[i]->label] == NULL)
            {
                newNode->neighbors.push_back(clone(node->neighbors[i]));
            }            
            else
            {
                newNode->neighbors.push_back(m_map[node->neighbors[i]->label]);
            }
        }
        return newNode;
    }
    
    map<int, UndirectedGraphNode*> m_map;
};

Round 2:

/**
 * Definition for undirected graph.
 * struct UndirectedGraphNode {
 *     int label;
 *     vector<UndirectedGraphNode *> neighbors;
 *     UndirectedGraphNode(int x) : label(x) {};
 * };
 */
class Solution {
public:
    UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
        if(node == NULL)
            return NULL;
        map<int, UndirectedGraphNode* > nodeMap;
        queue<UndirectedGraphNode* > bfs;
        bfs.push(node);
        while(!bfs.empty())
        {
            UndirectedGraphNode* oldNode = bfs.front();
            bfs.pop();
            UndirectedGraphNode* newNode = nodeMap[oldNode->label] == NULL ? new UndirectedGraphNode(oldNode->label) : nodeMap[oldNode->label];
            nodeMap[oldNode->label] = newNode;
            for(int i = 0; i < oldNode->neighbors.size(); i++)
            {
                if(oldNode->neighbors[i] == NULL)
                    continue;
                UndirectedGraphNode* newNeighbor;
                if(nodeMap[oldNode->neighbors[i]->label] == NULL)
                {
                    bfs.push(oldNode->neighbors[i]);
                    newNeighbor = new UndirectedGraphNode(oldNode->neighbors[i]->label);
                    nodeMap[oldNode->neighbors[i]->label] = newNeighbor;
                }
                else
                    newNeighbor = nodeMap[oldNode->neighbors[i]->label];
                newNode->neighbors.push_back(newNeighbor);
            }
        }
        return nodeMap[node->label];
    }

};