public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
if (node == null) {
return null;
}
Queue<UndirectedGraphNode> q = new LinkedList<UndirectedGraphNode>();
HashMap<UndirectedGraphNode, UndirectedGraphNode> map = new HashMap<>();
q.add(node);
map.put(node, new UndirectedGraphNode(node.label));
while (!q.isEmpty()) {
UndirectedGraphNode tmp = q.poll();
for (UndirectedGraphNode neighbor : tmp.neighbors){
if (!map.containsKey(neighbor)) {
map.put(neighbor, new UndirectedGraphNode(neighbor.label));
q.add(neighbor);
}
map.get(tmp).neighbors.add(map.get(neighbor));
}
}
return map.get(node);
}
}