标签：des style blog color io ar for strong sp
[问题描述]
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.
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 #.
0. Connect node 0 to both nodes 1 and 2.1. Connect node 1 to node 2.2. Connect node 2 to node 2 (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 }
标签：des style blog color io ar for strong sp
原文地址：http://www.cnblogs.com/taizy/p/4008713.html
