python解决最小修路消费问题
python解决最小修路消费问题X = dict()R = dict()def initialization(point): X[point] = point R[point] = 0def find(point): if X[point] != point: X[point] = find(X[point]) return X[point]def merge(point1, point2): r1 = find(point1) r
原创
2022-03-21 18:43:03 ·
1048 阅读 ·
0 评论