Lintcode 137. Clone Graph (Medium) (Python)

最新推荐文章于 2025-05-22 11:41:44 发布

2Young2Simple

最新推荐文章于 2025-05-22 11:41:44 发布

阅读量203

点赞数

CC 4.0 BY-SA版权

分类专栏： Lintcode刷题文章标签： Lintcode Python

本文链接：https://blog.youkuaiyun.com/weixin_41677877/article/details/82494835

Lintcode刷题专栏收录该内容

82 篇文章

订阅专栏

本文介绍了一种用于深拷贝无向图的算法，该算法通过深度优先搜索(DFS)实现。在无向图中，每个节点包含一个标签和邻居节点列表，通过DFS遍历所有节点并创建其副本，确保新旧图完全独立。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Clone Graph

Description:

Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.

How we serialize an undirected graph:

Nodes are labeled uniquely.

We use # as a separator for each node, and , as a separator for node label and each neighbor of the node.

As an example, consider the serialized graph {0,1,2#1,2#2,2}.

The graph has a total of three nodes, and therefore contains three parts as separated by #.

First node is labeled as 0. Connect node 0 to both nodes 1 and 2.
Second node is labeled as 1. Connect node 1 to node 2.
Third node is labeled as 2. Connect node 2 to node 2 (itself), thus forming a self-cycle.
Visually, the graph looks like the following:

1
/ \
/ \
0 — 2
/ \
_/
Example
return a deep copied graph.

Code:

"""
Definition for a undirected graph node
class UndirectedGraphNode:
    def __init__(self, x):
        self.label = x
        self.neighbors = []
"""


class Solution:
    """
    @param: node: A undirected graph node
    @return: A undirected graph node
    """
    def cloneGraph(self, node):
        # write your code here
        if not node:
            return None
        def dfs(input, map):
            if input in map:
                return map[input]
            output = UndirectedGraphNode(input.label)
            map[input] = output
            for i in input.neighbors:
                output.neighbors.append(dfs(i, map))
            return output
        return dfs(node, {})