首页 > 其他 > 详细

Clone Graph

时间:2015-01-01 21:16:58      阅读:326      评论:0      收藏:0      [点我收藏+]

图的复制

class Solution {
public:
    UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node ){
        unordered_map<UndirectedGraphNode*, UndirectedGraphNode*>map;
        if(node == NULL)
            return NULL;
        return clone(node,map);
    }
   UndirectedGraphNode *clone(UndirectedGraphNode *node, unordered_map<UndirectedGraphNode*,UndirectedGraphNode*>&map){
           if(map.find(node) != map.end())
         return map[node];
       UndirectedGraphNode *new_node = new UndirectedGraphNode(node->label);
       map[node] = new_node;
       for(int i = 0; i < node.neighbors.size(); i++)
        new_node->neighbors.push_back(clone(node->neighbors[i],map));
    return new_node;

   }
};


Clone Graph

原文:http://blog.csdn.net/sina012345/article/details/42321189

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!