Commit d3ad53e

authored

Update 0053.寻宝-Kruskal.md

1 parent fd0f78c commit d3ad53eCopy full SHA for d3ad53e

File tree

-2

lines changed

-2

lines changed

Lines changed: 4 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -607,7 +607,7 @@ int main()`
`607`	`607`	`conne_gra[i] = i;`
`608`	`608`	`}`
`609`	`609`
`610`		`- // 读取所有边的信息并存储到edg(存储所有边)数组中`
	`610`	`+ // 读取所有边的信息并存储到edg(存储所有边的)数组中`
`611`	`611`	`for (int i = 0; i < e; ++i)`
`612`	`612`	`{`
`613`	`613`	`scanf("%d%d%d", &v1, &v2, &val);`
`@@ -670,19 +670,21 @@ int main()`
`670`	`670`	`scanf("%d%d", &v, &e);`
`671`	`671`	`struct Edge edg = (struct Edge )malloc(sizeof(struct Edge) * e);`
`672`	`672`	`int conne_gra = (int )malloc(sizeof(int) * (v + 1));`
	`673`	`+`
`673`	`674`	`// 初始化连通图数组,每个顶点初始时只与自己相连通`
`674`	`675`	`for (int i = 0; i <= v; ++i)`
`675`	`676`	`{`
`676`	`677`	`conne_gra[i] = i;`
`677`	`678`	`}`
`678`		`- // 读取所有边的信息并存储到edg(存储所有边)数组中`
	`679`	`+ // 读取所有边的信息并存储到edg(存储所有边的)数组中`
`679`	`680`	`for (int i = 0; i < e; ++i)`
`680`	`681`	`{`
`681`	`682`	`scanf("%d%d%d", &v1, &v2, &val);`
`682`	`683`	`edg[i].vex1 = v1;`
`683`	`684`	`edg[i].vex2 = v2;`
`684`	`685`	`edg[i].val = val;`
`685`	`686`	`}`
	`687`	`+`
`686`	`688`	`bubblesort(edg, e); // 调用冒泡排序函数对边进行排序`
`687`	`689`
`688`	`690`	`// Kruskal算法的实现,通过边数组构建最小生成树`

Comments

(0)