Dinic算法解决最大流问题

 这篇文章主要介绍了Dinic算法的代码，由于关于最大流问题中牵涉的理论太多，加上这是我之前写过的代码，故如果大家想要了解理论的话可以参考B站上的视频：13-4: Dinic's Algorithm 寻找网络最大流_哔哩哔哩_bilibili

from collections import deque

class Edge:
    def __init__(self, v, capacity):
        self.v = v
        self.capacity = capacity
        self.rev = None

def add_edge(u, v, capacity):
    global adj
    global level

    forward = Edge(v, capacity)
    backward = Edge(u, 0)
    forward.rev = backward
    backward.rev = forward
    adj[u].append(forward)
    adj[v].append(backward)

def bfs():
    global level

    for i in range(n):
        level[i] = -1
    level[source] = 0

    q = deque()
    q.append(source)

    while q:
        u = q.popleft()
        for edge in adj[u]:
            v = edge.v
            if level[v] < 0 and edge.capacity > 0:
                level[v] = level[u] + 1
                q.append(v)

def dfs(u, flow):
    global adj
    global level

    if u == sink:
        return flow

    for edge in adj[u]:
        v = edge.v
        if level[u] < level[v] and edge.capacity > 0:
            f = dfs(v, min(flow, edge.capacity))
            if f > 0:
                edge.capacity -= f
                edge.rev.capacity += f
                return f

    return 0

def dinic():
    global level

    max_flow = 0

    while True:
        bfs()
        if level[sink] < 0:
            break
        while True:
            flow = dfs(source, float('inf'))
            if flow <= 0:
                break
            max_flow += flow

    return max_flow

# 测试样例
n = 6  # 网络中的节点数
source = 0  # 源节点
sink = 5  # 汇节点

adj = [[] for _ in range(n)]
level = [0] * n

# 添加网络边
add_edge(0, 1, 10)
add_edge(0, 2, 10)
add_edge(1, 2, 2)
add_edge(1, 3, 4)
add_edge(1, 4, 8)
add_edge(2, 4, 9)
add_edge(3, 5, 10)
add_edge(4, 3, 6)
add_edge(4, 5, 10)

max_flow = dinic()
print("最大流为:", max_flow)

 在上述代码中，我们需要依次将有向图中的边加入。