-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathClone_Graph.cpp
More file actions
93 lines (83 loc) · 2.83 KB
/
Copy pathClone_Graph.cpp
File metadata and controls
93 lines (83 loc) · 2.83 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
/**
* Definition for undirected graph.
* struct UndirectedGraphNode {
* int label;
* vector<UndirectedGraphNode *> neighbors;
* UndirectedGraphNode(int x) : label(x) {};
* };
*
*
* Solution: this clone is based on the edge instead of the node.
* This way will make sure the edge will be copied to the
* cloned graph as well.
*
*/
class Solution {
public:
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
if(node == nullptr) return nullptr;
unordered_map<UndirectedGraphNode *, UndirectedGraphNode *> map;
stack<UndirectedGraphNode *> st;
UndirectedGraphNode *t = nullptr;
UndirectedGraphNode *nGraph = new UndirectedGraphNode(node->label);
map[node] = nGraph;
st.push(node);
while(!st.empty()){
t = st.top();
st.pop();
for(int i = 0; i < t->neighbors.size(); i++){
UndirectedGraphNode *nb = t->neighbors[i];
if(map.find(nb) == map.end()){
UndirectedGraphNode *x = new UndirectedGraphNode(nb->label);
map[nb] = x;
map[t]->neighbors.push_back(x);
st.push(nb);
}else{
map[t]->neighbors.push_back(map[nb]);
}
}
}
return nGraph;
}
};
/**
* Definition for undirected graph.
* struct UndirectedGraphNode {
* int label;
* vector<UndirectedGraphNode *> neighbors;
* UndirectedGraphNode(int x) : label(x) {};
* };
*
*
* BFS based solution.
* It is almost identical to the DFS solution except the order of edge copying is different from DFS.
* DFS will make go deeper and deeper, while BFS will copy edges layer by layer.
*/
class Solution {
public:
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
if(node == nullptr) return nullptr;
unordered_map<UndirectedGraphNode *, UndirectedGraphNode *> map;
queue<UndirectedGraphNode *> st;
UndirectedGraphNode *t = nullptr;
UndirectedGraphNode *nGraph = new UndirectedGraphNode(node->label);
map[node] = nGraph;
st.push(node);
while(!st.empty()){
t = st.front();
st.pop();
for(int i = 0; i < t->neighbors.size(); i++){
UndirectedGraphNode *nb = t->neighbors[i];
if(map.find(nb) == map.end()){
UndirectedGraphNode *x = new UndirectedGraphNode(nb->label);
map[nb] = x;
map[t]->neighbors.push_back(x);
st.push(nb);
}else{
map[t]->neighbors.push_back(map[nb]);
}
}
}
return nGraph;
}
};