-
Notifications
You must be signed in to change notification settings - Fork 0
/
049_CloneGraph.cpp
57 lines (48 loc) · 1.19 KB
/
049_CloneGraph.cpp
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
#include<bits/stdc++.h>
using namespace std;
/***************************************************************************
Class for graph node is as follows:
******************************************************************************/
class graphNode
{
public:
int data;
vector<graphNode *> neighbours;
graphNode()
{
data = 0;
neighbours = vector<graphNode *>();
}
graphNode(int val)
{
data = val;
neighbours = vector<graphNode *>();
}
graphNode(int val, vector<graphNode *> neighbours)
{
data = val;
this->neighbours = neighbours;
}
};
void dfs(graphNode *node, graphNode *source, map<int, graphNode*> &visited){
for(auto neighbor: node->neighbours){
if(!visited[neighbor->data]){
graphNode* newNode=new graphNode(neighbor->data);
visited[neighbor->data]=newNode;
(source->neighbours).push_back(newNode);
dfs(neighbor, newNode, visited);
}else{
(source->neighbours).push_back(visited[neighbor->data]);
}
}
}
graphNode *cloneGraph(graphNode *node)
{
// Write your code here.
if(!node) return NULL;
map<int, graphNode*> visited;
graphNode *source=new graphNode(node->data);
visited[node->data]=source;
dfs(node, source, visited);
return source;
}