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
/ \_/
class Solution {
public:
<span style="white-space:pre"> </span>UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
<span style="white-space:pre"> </span>if (NULL == node) return NULL;
<span style="white-space:pre"> </span>map<int, UndirectedGraphNode *> occured;
<span style="white-space:pre"> </span>return clone(node, occured);
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>UndirectedGraphNode *clone(UndirectedGraphNode *node, map<int, UndirectedGraphNode *> &occured){
<span style="white-space:pre"> </span>if (occured.count(node->label) == 0){
<span style="white-space:pre"> </span>UndirectedGraphNode *newNode = new UndirectedGraphNode(node->label);
<span style="white-space:pre"> </span>occured[node->label] = newNode;
<span style="white-space:pre"> </span>for (int i = 0; i < node->neighbors.size(); i++){
<span style="white-space:pre"> </span>newNode->neighbors.push_back(clone(node->neighbors[i], occured));
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>return newNode;
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>else{
<span style="white-space:pre"> </span>return occured[node->label];
<span style="white-space:pre"> </span>}
<span style="white-space:pre"> </span>}
};class Solution {
public:
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
if (NULL == node) return NULL;
map<UndirectedGraphNode *, UndirectedGraphNode *> occured;
queue<UndirectedGraphNode *> visit;
visit.push(node);
while (!visit.empty()){
UndirectedGraphNode *cur = visit.front();
visit.pop();
if (occured.count(cur) == 0){
UndirectedGraphNode *newNode = new UndirectedGraphNode(cur->label);
occured[cur] = newNode;
}
for (int i = 0; i < cur->neighbors.size(); i++){
UndirectedGraphNode *tmp = cur->neighbors[i];
if (occured.count(tmp) == 0){
UndirectedGraphNode *newNode = new UndirectedGraphNode(tmp->label);
occured[tmp] = newNode;
visit.push(tmp);
}
occured[cur]->neighbors.push_back(occured[tmp]);
}
}
return occured[node];
}
};原文地址：http://blog.csdn.net/cr_peace/article/details/41693677
