Leetcode 133克隆图

133克隆图

"""
# Definition for a Node.
class Node:
    def __init__(self, val = 0, neighbors = []):
        self.val = val
        self.neighbors = neighbors
"""


class Solution:

    def cloneGraph(self, node: 'Node') -> 'Node':

        if not node:
            return node

        visited = {}

        queue = collections.deque()

        clone_node = Node(node.val, [])

        visited[node] = clone_node

        queue.append(node)
        while queue:
            new_node = queue.popleft()
            for neighbor in new_node.neighbors:
                if neighbor not in visited:
                    visited[neighbor] = Node(neighbor.val, [])
                    queue.append(neighbor)
                visited[new_node].neighbors.append(visited[neighbor])
        return visited[node]