按权重从大到小排序void sortEdges for int i = 0; i edgeCount - 1; i++ for int j = 0; j edgeCount - i - 1; j++ if edgesjweight edgesj + 1weight Edge temp = edgesj;

void sortEdges() { for (int i = 0; i < edgeCount - 1; i++) { for (int j = 0; j < edgeCount - i - 1; j++) { if (edges[j].weight > edges[j + 1].weight) { Edge temp = edges[j]; edges[j] = edges[j + 1]; edges[j + 1] = temp; } } } }