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 node0
to both nodes1
and2
. - Second node is labeled as
1
. Connect node1
to node2
. - Third node is labeled as
2
. Connect node2
to node2
(itself), thus forming a self-cycle.
Visually, the graph looks like the following:
1
/ \
/ \
0 --- 2
/ \
\_/
Code:
<span style="font-size:14px;">/**
* Definition for undirected graph.
* struct UndirectedGraphNode {
* int label;
* vector<UndirectedGraphNode *> neighbors;
* UndirectedGraphNode(int x) : label(x) {};
* };
*/
class Solution {
public:
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
if (node == NULL) return NULL;
UndirectedGraphNode *copy = node;
unordered_map<int, UndirectedGraphNode *> hashTable;
queue<UndirectedGraphNode *> q;
q.push(node);
while (!q.empty()) {
node = q.front();
q.pop();
if (hashTable.find(node->label) == hashTable.end()) {
hashTable[node->label] = new UndirectedGraphNode(node->label);
for (int i = 0; i < node->neighbors.size(); ++i)
q.push(node->neighbors[i]);
}
}
unordered_set<int> s;
q.push(copy);
while (!q.empty()) {
node = q.front();
q.pop();
if (s.find(node->label) == s.end()) {
s.insert(node->label);
for (int i = 0; i < node->neighbors.size(); ++i) {
q.push(node->neighbors[i]);
hashTable[node->label]->neighbors.push_back(hashTable[node->neighbors[i]->label]);
}
}
}
return hashTable[copy->label];
}
};</span>