leetcode---clone-graph---图

abeland a list of itsneighbors.

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#.

First node is labeled as0. Connect node0to both nodes1and2.
Second node is labeled as1. Connect node1to node2.
Third node is labeled as2. Connect node2to node2(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 *dfs(UndirectedGraphNode *node, map<int, UndirectedGraphNode*> &m) 
    {
        if (!node) 
            return NULL;
        if (m.count(node->label)) 
            return m[node->label];

        UndirectedGraphNode *tmp = new UndirectedGraphNode(node->label);
        m[node->label] = tmp;
        for (int i = 0; i < node->neighbors.size(); ++i) 
        {
            (tmp->neighbors).push_back(dfs(node->neighbors[i], m));
        }
        return tmp;
    } 

     UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) 
     {
        map<int, UndirectedGraphNode*> m;
        return dfs(node, m);
    }

};