首页 > 代码库 > leetcode -- Clone Graph
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 #.
- 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 / \_/
[解题思路]
深度优先遍历
1 UndirectedGraphNode *Solution::cloneGraph(UndirectedGraphNode *node){ 2 if (node == NULL) 3 return NULL; 4 map<UndirectedGraphNode*, UndirectedGraphNode*> visited; 5 queue<UndirectedGraphNode*> bfs_q; 6 visited[node] = new UndirectedGraphNode(node->label); 7 bfs_q.push(node); 8 while(!bfs_q.empty()){ 9 UndirectedGraphNode* tmp = bfs_q.front(); bfs_q.pop();10 for (auto k : tmp->neighbors){11 if (visited.find(k) == visited.end()){12 UndirectedGraphNode* t = new UndirectedGraphNode(k->label);13 visited[k] = t;14 visited[tmp]->neighbors.push_back(t);15 bfs_q.push(k);16 }17 else{18 visited[tmp]->neighbors.push_back(visited[k]);19 }20 }21 }22 return visited[node];23 }
leetcode -- Clone Graph
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。