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] &l