/*
knakul853
*/

class Solution {
public:
    Node* cloneGraph(Node* node)
    {
       if ( !node )
           return NULL;

        if(mp.find(node) == mp.end())
        {

            mp[node] = new Node(node->val, {});

            for(Node* neighbor : node->neighbors)
            {
                mp[node]->neighbors.push_back(cloneGraph( neighbor));
            }
        }

        return mp[ node ];
    }

    private:
    unordered_map<Node*, Node*> mp;

};