/*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> neighbors;
Node() {
val = 0;
neighbors = vector<Node*>();
}
Node(int _val) {
val = _val;
neighbors = vector<Node*>();
}
Node(int _val, vector<Node*> _neighbors) {
val = _val;
neighbors = _neighbors;
}
};
*/
class Solution {
private:
unordered_map<Node*,Node*> mp;
public:
Node* cloneGraph(Node* node) {
if(!node) return node;
if(mp.find(node)!=mp.end()) return mp[node];
Node *temp=new Node(node->val);
mp[node]=temp;
for(int i=0;i<node->neighbors.size();i++) {
temp->neighbors.push_back(cloneGraph(node->neighbors[i]));
}
return temp;
}
};