python解决最小修路消费问题

python解决最小修路消费问题

源于网络
时间太长
找不到来源了
如有原作
请告知 附链接

X = dict()
R = dict()

def initialization(point):
    X[point] = point
    R[point] = 0
def find(point):
    if X[point] != point:
        X[point] = find(X[point])
    return X[point]
def merge(point1, point2):
    r1 = find(point1)
    r2 = find(point2)
    if r1 != r2:
        if R[r1] > R[r2]:
            X[r2] = r1
        else:
            X[r1] = r2
            if R[r1] == R[r2]:
                R[r2] += 1
def kruskal(vertices,edges