Python中如何实现Edmonds算法？

class Graph:
    def __init__(self, vertices):
        self.V = vertices
        self.graph = [[] for _ in range(vertices)]

    def add_edge(self, u, v):
        self.graph[u].append(v)
        self.graph[v].append(u)

    def bfs(self, matching, dist):
        queue = []
        for v in range(self.V):
            if matching[v] == -1:
                dist[v] = 0
                queue.append(v)
            else:
                dist[v] = float('inf')
        dist[-1] = float('inf')
        while queue:
            v = queue.pop(0)
            if v != -1:
                for u in self.graph[v]:
                    if dist[matching[u]] == float('inf'):
                        dist[matching[u]] = dist[v] + 1
                        queue.append(matching[u])
        return dist[-1] != float('inf']

    def dfs(self, v, matching, dist):
        if v != -1:
            for u in self.graph[v]:
                if dist[matching[u]] == dist[v] + 1:
                    if self.dfs(matching[u], matching, dist):
                        matching[u] = v
                        matching[v] = u
                        return True
            dist[v] = float('inf')
            return False
        return True

    def edmonds(self):
        matching = [-1] * self.V
        dist = [float('inf')] * self.V
        while self.bfs(matching, dist):
            for v in range(self.V):
                if matching[v] == -1 and self.dfs(v, matching, dist):
                    break
        return matching

# 使用示例
g = Graph(6)
g.add_edge(0, 1)
g.add_edge(0, 2)
g.add_edge(1, 2)
g.add_edge(1, 3)
g.add_edge(2, 4)
g.add_edge(3, 4)
g.add_edge(3, 5)
g.add_edge(4, 5)

matching = g.edmonds()
print("最大匹配：", [(i, matching[i]) for i in range(g.V) if matching[i] != -1])