leetcode133

class Solution:
    def cloneGraph(self, node: 'Node') -> 'Node':
        if not node:
            return None
        queue = [node]
        dup_node = Node(node.val,[])
        fakequeue = [dup_node]
        visited = []
        d = {}
        d[node.val] = dup_node
        while queue:
            node = queue.pop(0)
            newnode = fakequeue.pop(0)
            if node.val in visited:
                continue
            visited.append(node.val)
            for i in node.neighbors:
                if not i.val in d:
                    j = Node(i.val,[])
                    d[i.val] = j
                else:
                    j = d[i.val]
                newnode.neighbors.append(j)
                queue.append(i)
                fakequeue.append(j)
        return dup_node

算法思路：BFS

参考：https://leetcode.com/problems/clone-graph/discuss/440722/Python-3-BFS