Python:实现拓扑排序算法(附完整源码)

最新推荐文章于 2025-03-28 20:43:37 发布

源代码大师

最新推荐文章于 2025-03-28 20:43:37 发布

阅读量691

点赞数

分类专栏： python算法完整教程文章标签：排序算法算法 python

不予转载，严禁转载，违者必纠。

本文链接：https://blog.csdn.net/it_xiangqiang/article/details/126001715

版权

python算法完整教程专栏收录该内容

815 篇文章 ¥29.90 ¥99.00

订阅专栏

超级会员免费看

本文详细介绍了如何使用Python实现拓扑排序算法，包括关键步骤和完整源代码，帮助理解拓扑排序的工作原理。

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

Python:实现拓扑排序算法

clothes = {
    0: "underwear",
    1: "pants",
    2: "belt",
    3: "suit",
    4: "shoe",
    5: "socks",
    6: "shirt",
    7: "tie",
    8: "watch",
}

graph = [[1, 4], [2, 4], [3], [], [], [4], [2, 7], [3], []]

visited = [0 for x in range(len(graph))]
stack = []


def print_stack(stack, clothes):
    order = 1
    while stack:
        current_clothing = stack.pop()
        print(order, clothes[current_clothing])
        order += 1


def depth_first_search(u, visited, graph):
    visited[u] = 1
    for v in graph[u]:
        if not visited[v]:
            depth_first_search(v, visited, graph)

    stack.append(u)


def topological_sort(graph, visited):
    for v in range(len(graph)):
        if not visited[v]:
            depth_first_search(v, visited, graph)


if __name__ == "__main__":
    topological_sort(graph, visited)
    print(stack)
    print_stack(stack, clothes)