133. 克隆图

在这里插入代码片算法-目录
题目来源：Leetcode 133. 克隆图
参考：深搜（dfs）-广搜（bfs）python实现

方法一：深度优先搜索DFS

"""
# Definition for a Node.
class Node(object):
    def __init__(self, val = 0, neighbors = None):
        self.val = val
        self.neighbors = neighbors if neighbors is not None else []
"""

class Solution(object):
    def cloneGraph(self, node):
        """
        :type node: Node
        :rtype: Node
        """
        visited = {}
        def dfs(node):
            #print(node.val)
            if not node: 
                return node
            if node in visited:
                return visited[node]
            clone = Node(node.val, []) #建立一个头clone
            visited[node] = clone #将克隆的头加入已经访问过的表，防止重复访问。
            for n in node.neighbors: #对于头节点的每一个相邻节点，加入到克隆的头的邻居中
                clone.neighbors.append(dfs(n)) #邻居中加入的是每一个邻接点的克隆，再用一次DFS 
            return clone #返回的是克隆的头节点
        return dfs(node)

方法二：广度优先搜索BFS

# 完整测试代码
class Node:
    def __init__(self, val, neighbors):
        self.val = val
        self.neighbors = neighbors
        
def cloneGraph(self, node):
        """
        :type node: Node
        :rtype: Node
        """
        if not node:
            return node
        visited = {}
        queue = deque([node]) # 将题目给定的节点添加到队列
        visited[node] = Node(node.val, []) # 克隆第一个节点并存储到哈希表中
        while queue:
            n = queue.popleft() # 取出队列的头节点
            for neighbor in n.neighbors:  # 遍历该节点的邻居
                if neighbor not in visited:
                    visited[neighbor] = Node(neighbor.val, []) # 如果没有被访问过，就克隆并存储在哈希表中
                    queue.append(neighbor) # 将邻居节点加入队列中
                visited[n].neighbors.append(visited[neighbor]) # 更新当前节点的邻居列表
        return visited[node]

'''
if __name__ == '__main__':
    S = Solution()
    ns = [Node(i, []) for i in range(0, 5)]
    ns[1].neighbors = [ns[2], ns[4]]
    ns[2].neighbors = [ns[1], ns[3]]
    ns[3].neighbors = [ns[2], ns[4]]
    ns[4].neighbors = [ns[3], ns[1]]

    res = S.cloneGraph(ns[1])
    '''