public class Solution {
    public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        Queue<UndirectedGraphNode> q = new Queue<>();
        UndirectedGraphNode n;
        UndirectedGraphNode ptr = n;
        q.add(node);

        while(!q.isEmpty){
            UndirectedGraphNode graphNode = q.poll();
            n = new UndirectedGraphNode(graphNode.label);
            n.neighbors = graphNode.neighbors;

            for(int i = 0; i < graphNode.neighbors.size(); i++) {
                q.add(graphNode.neighbors.get(i));
            }
        }
        return ptr;
    }
}