Cyrus_May的博客

def prim(graph,n): state = [0 for i in range(n)] dist = [float("inf") for _ in range(n)] result = [] for i in range(n): if dist[0] == float("inf"): idx = 0 dist[0] = 0 else: mx = float(".

堆排序-Pythonpython代码 python代码 def build_heap(array): for i in range(len(array)//2-1,-1,-1): big_heap(array,i,len(array)) def big_heap(array,idx,n): l,r = 2*idx+1,2*idx+2 large = idx if l < n and array[large] < array[l]: