拓扑排序的Python实现

拓扑排序

BFS

from collections import deque, defaultdict

def topo_sort_bfs(num_courses, prerequisites):
    # 创建一个图和入度数组
    graph = defaultdict(list)
    in_degree = [0] * num_courses

    # 填充图和入度数组
    for dest, src in prerequisites:
        graph[src].append(dest)
        in_degree[dest] += 1

    # 使用队列来进行BFS
    queue = deque()
    for i in range(num_courses):
        if in_degree[i] == 0:
            queue.append(i)

    topo_order = []

    while queue:
        node = queue.popleft()
        topo_order.append(node)

        for neighbor in graph[node]:
            in_degree[neighbor] -= 1
            if in_degree[neighbor] == 0:
                queue.append(neighbor)

    # 如果拓扑排序结果包含所有课程，则返回拓扑顺序，否则返回空列表（有循环）
    return topo_order if len(topo_order) == num_courses else []

DFS

def topo_sort_dfs(num_courses, prerequisites):
    # 创建一个图
    graph = defaultdict(list)
    for dest, src in prerequisites:
        graph[src].append(dest)

    # 标记每个节点的状态：0=未访问, 1=正在访问, 2=已访问
    visited = [0] * num_courses
    topo_order = []
    cycle = False

    def dfs(node):
        nonlocal cycle
        if visited[node] == 1:
            cycle = True
            return
        if visited[node] == 0:
            visited[node] = 1
            for neighbor in graph[node]:
                dfs(neighbor)
            visited[node] = 2
            topo_order.append(node)

    for i in range(num_courses):
        if visited[i] == 0:
            dfs(i)
            if cycle:
                return []

    # 返回拓扑排序的逆序
    return topo_order[::-1]