Python中使用DFS求图(Graph)的连通分量

graph = {
    'p': set(['i', 'd', 'a', 'n', 'c', 'o', 'd', 'e']),
    'i': set(['p']),
    'd': set(['p']),
    'a': set(['p']),
    'n': set(['p']),
    'c': set(['p']),
    'o': set(['p']),
    'e': set(['p']),
    '皮': set(['蛋', '编', '程']),
    '蛋': set(['皮', '编', '程']),
    '编': set(['皮', '蛋', '程']),
    '程': set(['皮', '蛋', '编'])
}

def dfs(graph, start):
    visited = set()
    stack = [start]
    while stack:
        vertex = stack.pop()
        if vertex not in visited:
            visited.add(vertex)
            stack.extend(graph[vertex] - visited)
    return visited

def find_components(graph):
    visited = set()
    components = []
    for vertex in graph:
        if vertex not in visited:
            component = dfs(graph, vertex)
            visited.update(component)
            components.append(component)
    return components

print(find_components(graph))

[set(['a', 'c', 'd', 'e', 'i', 'n', 'p']), set(['编', '程', '蛋', '皮'])]