-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path133_CloneGraph.cpp
More file actions
261 lines (234 loc) · 5.34 KB
/
Copy path133_CloneGraph.cpp
File metadata and controls
261 lines (234 loc) · 5.34 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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
#include <vector>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
struct UndirectedGraphNode {
int label;
vector<UndirectedGraphNode *> neighbors;
UndirectedGraphNode(int x) : label(x) {};
};
class Graph
{
public:
Graph();
void build_graph();
void print_graph();
void dfs_graph();
void bfs_graph();
~Graph();
//private:
void insert_edge(int x, int y);
void init_graph();
void dfs_one_node(UndirectedGraphNode *node, map<int, bool> &visited, int &clock);
void bfs_one_node(UndirectedGraphNode *node, map<int, bool> &visited, queue<int> &nodeQueue);
//void destory_graph();
map<int, UndirectedGraphNode*> verteces;
vector<int> degree;
int nVerteces;
int nEdges;
};
void Graph::init_graph()
{
nVerteces = 0;
nEdges = 0;
}
Graph::Graph()
{
init_graph();
}
Graph::~Graph()
{
}
void Graph::build_graph()
{
cout << "Please input vertex number and edge number" << endl;
cin >> nVerteces >> nEdges;
int x, y;
cout << "Please input every edge" << endl;
for (int i = 0; i < nEdges; i++)
{
cin >> x >> y;
insert_edge(x, y);
insert_edge(y, x);
}
}
void Graph::insert_edge(int x, int y)
{
UndirectedGraphNode *p = nullptr;
if (verteces.count(y) == 0)
{
p = new UndirectedGraphNode(y);
verteces[y] = p;
}
else
{
p = verteces[y];
}
if (verteces.count(x) == 0)
{
verteces[x] = new UndirectedGraphNode(x);
}
verteces[x]->neighbors.push_back(p);
}
void Graph::print_graph()
{
for (auto it = verteces.begin(); it != verteces.end(); it++)
{
UndirectedGraphNode *node= it->second;
int label = it->first;
cout << "Label " << label << ": ";
for(auto it_vec = node->neighbors.begin(); it_vec != node->neighbors.end(); it_vec++)
{
cout << (*it_vec)->label << " ";
}
cout << endl;
}
}
void Graph::dfs_one_node(UndirectedGraphNode *node, map<int, bool> &visited, int &clock)
{
if(visited[node->label] == true)
{
return;
}
visited[node->label] = true;
//cout << node->label << endl;
cout << node->label << "begin :" << clock << endl;
clock++;
for (int i = 0; i < node->neighbors.size(); i++)
{
dfs_one_node(node->neighbors[i], visited, clock);
}
cout << node->label << "end: " << clock << endl;
clock++;
}
void dfs_one_node(UndirectedGraphNode *node, map<int, int> &visited)
{
if(visited.count(node->label) != 0)
{
return;
}
visited[node->label] ++;
cout << node->label << endl;
for (int i = 0; i < node->neighbors.size(); i++)
{
dfs_one_node(node->neighbors[i], visited);
}
}
void Graph::dfs_graph()
{
map<int, bool> visited;
for(auto it_map=verteces.begin(); it_map != verteces.end(); it_map++)
{
visited[it_map->first] = false;
}
int clock = 0;
dfs_one_node(verteces.begin()->second, visited, clock);
}
void Graph::bfs_one_node(UndirectedGraphNode *node, map<int, bool> &visited, queue<int> &nodeQueue)
{
if (visited[node->label] == false)
{
cout << node->label << endl;
visited[node->label] = true;
}
for (int i = 0; i < node->neighbors.size(); i++)
{
if (visited[node->neighbors[i]->label] == false)
{
cout << node->neighbors[i]->label << endl;
visited[node->neighbors[i]->label] = true;
nodeQueue.push(node->neighbors[i]->label);
}
}
while (nodeQueue.empty() == false)
{
int nodeLabel = nodeQueue.front();
nodeQueue.pop();
bfs_one_node(verteces[nodeLabel], visited, nodeQueue);
}
}
void Graph::bfs_graph()
{
map<int, bool> visited;
queue<int> nodeQueue;
for(auto it_map=verteces.begin(); it_map != verteces.end(); it_map++)
{
visited[it_map->first] = false;
}
bfs_one_node(verteces.begin()->second, visited, nodeQueue);
}
class Solution {
public:
UndirectedGraphNode *cloneGraph(UndirectedGraphNode *node) {
UndirectedGraphNode* cloned = NULL;
map<int, UndirectedGraphNode*> recodeMap;
queue<UndirectedGraphNode*> nodeQueue;
map<int, int> visited;
processOneNode(node, cloned, visited, nodeQueue, recodeMap);
return cloned;
}
void processOneNode(UndirectedGraphNode* node,
UndirectedGraphNode* &cloned,
map<int, int> &visited,
queue<UndirectedGraphNode*> &nodeQueue,
map<int, UndirectedGraphNode*> &recodeMap)
{
if (node == NULL)
{
cloned = NULL;
return;
}
if(visited.count(node->label) == 0)
{
visited[node->label]++ ;
if (recodeMap.count(node->label) == 0)
{
cloned = new UndirectedGraphNode(node->label);
recodeMap[node->label] = cloned;
}
}
for (int i = 0; i < node->neighbors.size(); i++)
{
if (recodeMap.count(node->neighbors[i]->label) == 0)
{
// New a node if the leighbor doesn't exist
UndirectedGraphNode *p = new UndirectedGraphNode(node->neighbors[i]->label);
recodeMap[node->neighbors[i]->label] = p;
cloned->neighbors.push_back(p);
}
else
{
cloned->neighbors.push_back(recodeMap[node->neighbors[i]->label]);
}
if (visited.count(node->neighbors[i]->label) == 0)
{
visited[node->neighbors[i]->label]++;
nodeQueue.push(node->neighbors[i]);
}
}
while (!nodeQueue.empty())
{
UndirectedGraphNode *popedNode = nodeQueue.front();
nodeQueue.pop();
processOneNode(popedNode, recodeMap[popedNode->label], visited, nodeQueue, recodeMap);
}
}
};
/*
int main()
{
Graph g;
g.build_graph();
g.print_graph();
//g.dfs_graph();
//g.bfs_graph();
Solution sln;
UndirectedGraphNode *cloned =
sln.cloneGraph(g.verteces.begin()->second);
map<int, int> visited;
dfs_one_node(cloned,visited);
system("PAUSE");
return 0;
}
*/