Solution Class Reference

Public Member Functions
void	delete_graph (Node *node)
void	print_graph (Node *node)
	Prints graph nodes of a connected node using BFS.
Node *	cloneGraph (Node *node)

Detailed Description

Definition at line 31 of file main.cpp.

Member Function Documentation

cloneGraph()

Node * Solution::cloneGraph ( Node *  node )

inline

Definition at line 87 of file main.cpp.

    {
        if (!node)
            return NULL;
 
        unordered_map<Node*, Node*> node_map; // first node is the original node, second one is it's clone
        queue<Node*> node_queue;
 
        // cloning the source node
        Node* new_node = new Node(node->val);
 
        node_map[node] = new_node;
        node_queue.push(node);
 
        while (!node_queue.empty())
        {
            Node* current = node_queue.front();
            node_queue.pop();
 
            vector<Node*>& v = current->neighbors;
            for (int i = 0; i < (int)v.size(); ++i)
            {
                if (node_map[v[i]] == NULL)
                {
                    new_node = new Node(v[i]->val);
                    new_node->neighbors.reserve(2); // at least two reserved fields for the neighbors
                    node_map[v[i]] = new_node;
                    node_queue.push(v[i]);
                }
                node_map[current]->neighbors.push_back(node_map[v[i]]);
            }
        }
        return node_map[node];
    }

References Node::neighbors, and Node::val.

Referenced by main().

delete_graph()

void Solution::delete_graph ( Node *  node )

inline

Definition at line 34 of file main.cpp.

    {
        if (!node)
            return;
        set<Node*> visited;
        queue<Node*> node_queue;
        node_queue.push(node);
        visited.insert(node);
        while (!node_queue.empty())
        {
            Node* current = node_queue.front();
            node_queue.pop();
 
            for (Node* neighbor: current->neighbors)
            {
                if (neighbor && visited.find(neighbor) == visited.end())
                {
                    node_queue.push(neighbor);
                    visited.insert(neighbor);
                }
            }
            delete current;
        }
    }

References Node::neighbors.

Referenced by main().

print_graph()

void Solution::print_graph ( Node *  node )

inline

Prints graph nodes of a connected node using BFS.

Definition at line 62 of file main.cpp.

    {
        if (!node)
            return;
        set<Node*> visited;
        queue<Node*> node_queue;
        node_queue.push(node);
        visited.insert(node);
        while (!node_queue.empty())
        {
            Node* current = node_queue.front();
            node_queue.pop();
 
            cout << "Node " << current->val << "; address: " << current << endl;
            for (Node* neighbor: current->neighbors)
            {
                if (neighbor && visited.find(neighbor) == visited.end())
                {
                    node_queue.push(neighbor);
                    visited.insert(neighbor);
                }
            }
        }
    }

References Node::neighbors, and Node::val.

Referenced by main().

---

The documentation for this class was generated from the following file:

• main.cpp