leetcode：Clone Graph

复制图的结构，直接使用BFS广度优先搜索的方法进行图的遍历

利用HashMap作为是否访问过的标记

<span style="font-size:18px;">/**
 * Definition for undirected graph.
 * class UndirectedGraphNode {
 *     int label;
 *     List<UndirectedGraphNode> neighbors;
 *     UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); }
 * };
 */
public class Solution {
    
    
    public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
        if(node == null) return node;
        
        HashMap<Integer, UndirectedGraphNode> cloneMap = new HashMap<>();
        UndirectedGraphNode clone = new UndirectedGraphNode(node.label);
        
        LinkedList<UndirectedGraphNode> nodeQueue = ne