复制无向图，用邻接表结构

本题源自LeetCode

---------------------------------------------------------------------------------

1 广度优先遍历 用队列

2 用一个map存储节点与复制节点的对应，避免重复复制

广度优先遍历

UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
        if(node==NULL)
            return NULL;
        //利用map存节点与复制点的对应关系
        unordered_map<UndirectedGraphNode*,UndirectedGraphNode*> mp;
        UndirectedGraphNode *p=new UndirectedGraphNode(node->label);
        mp[node]=p;
        //广度优先遍历用队列
        deque<UndirectedGraphNode*> que;
        que.push_back(node);
        while(!que.empty()){
            UndirectedGraphNode *q=que.front();
            que.pop_front();
            for(UndirectedGraphNode *v:q->neighbors){
                if(!mp[v]){
                    UndirectedGraphNode *next=new UndirectedGraphNode(v->label);
                    mp[v]=next;
                    que.push_back(v);
                }
                mp[q]->neighbors.push_back(mp[v]);
            }  
        }
        return p;
    }

深度优先遍历

    UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
        if(node==NULL)
            return NULL;
        //利用map存节点与复制点的对应关系
        unordered_map<UndirectedGraphNode*,UndirectedGraphNode*> mp;
        UndirectedGraphNode *p=new UndirectedGraphNode(node->label);
        mp[node]=p;
        //深度优先遍历用队列
        stack<UndirectedGraphNode*> que;
        que.push(node);
        while(!que.empty()){
            UndirectedGraphNode *q=que.top();
            que.pop();
            for(UndirectedGraphNode *v:q->neighbors){
                if(!mp[v]){
                    UndirectedGraphNode *next=new UndirectedGraphNode(v->label);
                    mp[v]=next;
                    que.push(v);
                }
                mp[q]->neighbors.push_back(mp[v]);
            }  
        }
        return p;
    }