首页 > 代码库 > 21. Clone Graph
21. Clone Graph
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 #.
- First node is labeled as
0. Connect node0to both nodes1and2. - Second node is labeled as
1. Connect node1to node2. - Third node is labeled as
2. 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) {}; * }; */ typedef UndirectedGraphNode NODE; typedef pair<NODE*, NODE*> PAIR; NODE* dfs(NODE *node, unordered_map<NODE*, NODE*> &_map) { if(_map.count(node)) return _map[node]; NODE *p = new NODE(node->label); _map.insert(PAIR(node, p)); for(size_t i = 0; i < node->neighbors.size(); ++i) { p->neighbors.push_back(dfs(node->neighbors[i], _map)); } return p; } class Solution {public: UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) { unordered_map<NODE*, NODE*> _map; _map[NULL] = NULL; return dfs(node, _map); }};
21. Clone Graph
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。